The missing evaluation codes from order domain theory

Henning Ejnar Andersen, Olav Geil

Publikation: Bog/antologi/afhandling/rapportRapportForskning

366 Downloads (Pure)

Abstrakt

The Feng-Rao bound gives a lower bound on the minimum distance of codes defined by means of their parity check matrices. From the Feng-Rao bound it is clear how to improve a large family of codes by leaving out certain rows in their parity check matrices. In this paper we derive a simple lower bound on the minimum distance of codes defined by means of their generator matrices. From our bound it is clear how to improve a large family of codes by adding certain rows to their generator matrices. Actually our result not only deals with the minimum distance but gives lower bounds on any generalized Hamming weight. We interpret our methods into the setting of order domain theory. In this way we fill in an obvious gap in the theory of order domains. The improved codes from the present paper are not in general equal to the Feng-Rao improved codes but the constructions are very much related.
OriginalsprogEngelsk
UdgivelsesstedAalborg
ForlagDepartment of Mathematical Sciences, Aalborg University
Antal sider18
StatusUdgivet - 2004
NavnResearch Report Series
NummerR-2004-17
ISSN1399-2503

Fingeraftryk

Dyk ned i forskningsemnerne om 'The missing evaluation codes from order domain theory'. Sammen danner de et unikt fingeraftryk.

Citationsformater