Designs, Codes and Cryptography

, Volume 66, Issue 1–3, pp 3–16 | Cite as

Algebraic decoding of negacyclic codes over \({\mathbb Z_4}\)

  • Eimear Byrne
  • Marcus Greferath
  • Jaume Pernas
  • Jens Zumbrägel
Article

Abstract

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 \({\mathbb {Z}_4}\) ; 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.

Keywords

Negacyclic code Integers modulo 4 Lee metric Galois ring Decoding Gröbner bases Key equation Solution by approximations Module of solutions 

Mathematics Subject Classification

94B15 94B35 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Adams W.W., Loustaunau P.: An Introduction to Gröbner Bases. American Mathematical Society, Providence, RI (1994).Google Scholar
  2. 2.
    Berlekamp E.R.: Negacyclic codes for the Lee metric. In: Combinatorial Mathematics and Its Applications (Proc. Conference, University of North Carolina, Chapel Hill, NC, 1967), pp. 298–316. University of North Carolina, Chapel Hill, NC (1969).Google Scholar
  3. 3.
    Berlekamp E.R.: Algebraic Coding Theory. McGraw-Hill, New York (1968)MATHGoogle Scholar
  4. 4.
    Byrne E., Fitzpatrick P.: Hamming metric decoding of alternant codes over Galois rings. IEEE Trans. Inf. Theory 48(3), 683–694 (2002)MathSciNetMATHCrossRefGoogle Scholar
  5. 5.
    Byrne E., Mora T.: Gröbner bases over commutative rings and applications to coding theory. In: Sala, M., Mora, T., Perret, L., Sakata, S., Traverso, C. (eds) Gröbner Bases, Coding, and Cryptography., pp. 239–261. RISC Series. Springer, Berlin (2009)CrossRefGoogle Scholar
  6. 6.
    Fitzpatrick P.: On the key equation. IEEE Trans. Inf. Theory 41(5), 1290–1302 (1995)MathSciNetMATHCrossRefGoogle Scholar
  7. 7.
    Guerini E., Rimoldi A.: FGLM-like decoding: from Fitzpatrick’s approach to recent developments. In: Sala, M., Mora, R., Perret, L., Sakata, S., Traverso, C. (eds) Gröbner Bases, Coding, and Cryptography., pp. 197–218. RISC Series. Springer, Berlin (2009)CrossRefGoogle Scholar
  8. 8.
    Raghavendran R.: Finite associative rings. Compos. Math. 21, 195–229 (1969)MathSciNetMATHGoogle Scholar
  9. 9.
    Wolfmann J.: Negacyclic and cyclic codes over \({{\mathbb Z}_4^n}\) . IEEE Trans. Inf. Theory 45(7), 2527–2532 (1999)MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  • Eimear Byrne
    • 1
  • Marcus Greferath
    • 1
  • Jaume Pernas
    • 2
  • Jens Zumbrägel
    • 1
  1. 1.Claude Shannon Institute, School of Mathematical SciencesUniversity College DublinDublin 4Ireland
  2. 2.Departament d’Enginyeria de la Informació i de les ComunicacionsUniversitat Autonoma de BarcelonaBellaterraSpain

Personalised recommendations