Duality for Several Families of Evaluation Codes

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We consider generalizations of Reed-Muller codes, toric codes, and codes from certain plane curves, such as those defined by norm and trace functions on finite fields. In each case we are interested in codes defined by evaluating arbitrary subsets of monomials, and in identifying when the dual codes are also obtained by evaluating monomials. We then move to the context of order domain theory, in which the subsets of monomials can be chosen to optimize decoding performance using the Berlekamp-Massey-Sakata algorithm with majority voting. We show that for the codes under consideration these subsets are well-behaved and the dual codes are also defined by monomials.
Added references

Keywords

Information Theory, Discrete Mathematics, E.4

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/134294

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0609159
 http://arxiv.org/abs/cs/0609159

Collections

arXiv