Algebraic Decoding of Negacyclic Codes Over Z_4

Details Algebraic Decoding of Negacyclic Codes Over Z_4 Algebraic Decoding of Negacyclic Codes Over Z_4

2011-02-17

arxiv.org/abs/1102.3604v5

Mathematics

Combinatorics

17 pages

Scientific paper

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. The codes considered here have minimim Lee distance at least 2t+1, where the generator polynomial of the code has roots z,z^3,...,z^{2t+1} for a primitive 2nth root of unity z 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 at most t. Our treatment uses Grobner bases and the decoding complexity is quadratic in t.

Affiliated with

Also associated with

No associations

Rating

Algebraic Decoding of Negacyclic Codes Over Z_4 does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Algebraic Decoding of Negacyclic Codes Over Z_4, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algebraic Decoding of Negacyclic Codes Over Z_4 will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-380722