Abstract
Let R be a commutative ring e.g. the domain of p-adic integers or a Galois ring. We define alternant codes over R, which includes BCH and Reed-Solomon codes. We also define a corresponding key equation and concentrate on decoding alternant codes when R is a domain or a local ring. Our approach is based on minimal realization (MR) of a finite sequence [4,5], which is related to rational approximation and shortest linear recurrences. The resulting algorithms have quadratic complexity.
When R is a domain, the error-locator polynomial is the unique monic minimal polynomial of the finite syndrome sequence (Theorem 2), and can be easily obtained using Algorithm MR of [4] (which is division-free). The error locations and magnitudes can then be computed as over a field. In this way we can efficiently decode any alternant code over a domain.
Recall that a Hensel ring is a local ring which admits Hensel lifting. (It is well-known that a finite local ring, such as a Galois ring, is a Hensel ring.) We characterize the set of monic minimal polynomials of a finite syndrome sequence over a Hensel ring (Theorem 3). It turns out that the monic minimal polynomials coincide modulo the maximal ideal M of R (Theorem 4) when R is a local ring. This yields an efficient new decoding algorithm (Algorithm 1) for alternant codes over a local ring R, once a monic minimal polynomial of the syndrome sequence is known. For determining the error locations, it is enough to find the roots of the image of any such monic minimal polynomial in the residue field R/M. After determining the error locations, the error magnitudes can be easily computed.
When R is a finite chain ring (e.g. a Galois ring) we invoke Algorithm MP of [5] to find a monic minimal polynomial.
We note that a modification of the Berlekamp-Massey algorithm for ℤm was given in [8], where it was claimed [loc. cit., Introduction] (without proof) to decode BCH codes defined over the integers modulo m. An algorithm to decode BCH and Reed-Solomon codes over a Galois ring has also been given in [3]. However this algorithm may require some searching see [loc. cit., Conclusions, p. 1019] and their decoding algorithm requires root-finding in R itself, which is also less efficient.
For more details and proofs, we refer the reader to [7].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A.R. Calderbank and N.J.A. Sloane. Modular and p-adic codes. Designs, Codes and Cryptography, 6:21–35, 1995.
A.A. de Andrade and R. Palazzo, Jr. Construction and decoding of BCH codes over finite commutative rings. Linear Algebra and its Applications, 286:69–85, 1999.
J.C. Interlando, R. Palazzo, and M. Elia. On the decoding of Reed-Solomon and BCH codes over integer residue rings. IEEE Trans. Inform. Theory, 43(3):1013–1021, 1997.
G.H. Norton. On the minimal realizations of a finite sequence. J. Symbolic Computation, 20:93–115, 1995.
G.H. Norton. On minimal realization over a finite chain ring. Designs, Codes and Cryptography, 16:161–178, 1999.
G.H. Norton. On shortest linear recurrences. J. Symbolic Computation, 27:323–347, 1999.
G.H. Norton and A. Sălăgean. On the key equation over a commutative ring. Designs, Codes and Cryptography, 1999. To appear.
J.A. Reeds and N.J.A. Sloane. Shift-register synthesis (modulo m). SIAM J. Computing, 14:505–513, 1985.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Norton, G.H., Sălăgean, A. (1999). On Efficient Decoding of Alternant Codes over a Commutative Ring⋆. In: Walker, M. (eds) Cryptography and Coding. Cryptography and Coding 1999. Lecture Notes in Computer Science, vol 1746. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46665-7_19
Download citation
DOI: https://doi.org/10.1007/3-540-46665-7_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66887-9
Online ISBN: 978-3-540-46665-9
eBook Packages: Springer Book Archive