Algebraic decoding of negacyclic codes over $Bbb Z_4$

Eimear Byrne, Marcus Greferath, Jaume Pernas, Jens Zumbrägel

Tutkimustuotos: LehtiartikkeliArticleScientificvertaisarvioitu

5 Sitaatiot (Scopus)

Abstrakti

In this article we investigate Berlekamp’s negacyclic codes and discover that these codes, when considered over the integers modulo 4, do not suffer any of the restrictions on the minimum distance observed in Berlekamp’s original papers: our codes have minimum Lee distance at least 2t + 1, where the generator polynomial of the code has roots α, α3, . . . , α2t-1 for a primitive 2nth root α of unity in a Galois extension of Z4 ; no restriction on t is imposed. We present an algebraic decoding algorithm for this class of codes that corrects any error pattern of Lee weight ≤ t. Our treatment uses Gröbner bases, the decoding complexity is quadratic in t.
AlkuperäiskieliEi tiedossa
Sivut3-16
Sivumäärä14
JulkaisuDESIGNS CODES AND CRYPTOGRAPHY
Vuosikerta66
Numero1-3
DOI - pysyväislinkit
TilaJulkaistu - 2013
OKM-julkaisutyyppiA1 Julkaistu artikkeli, soviteltu

Siteeraa tätä