Algebraic decoding of (79,40,15) quadratic residue code using inverse-free Berlekamp-Massey algorithm

1Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, an algebraic decoding method is proposed for the quadratic residue codes that utilize the Berlekamp-Massey (BM) algorithm. By applying a technique developed in [l], one can express unknown syndromes as functions of known syndromes. The unknown syndromes are determined by an efficient algorithm also developed in this paper. With the appearance of unknown syndromes, one obtains the consecutive syndromes that are needed for the application of the inverse-free BM algorithm [2-51. The new decoding scheme developed here can be used to implement the (79, 40, 15) quadratic residue (QR) code which has not been treated so far. It is verified by a computer program that uses the C++ language.

Cite

CITATION STYLE

APA

Truong, T. K., Chang, Y., Reed, I. S., He, R., Lee, C. D., & Chen, Y. H. (2003). Algebraic decoding of (79,40,15) quadratic residue code using inverse-free Berlekamp-Massey algorithm. In Proceedings - 2003 IEEE Information Theory Workshop, ITW 2003 (pp. 238–244). Institute of Electrical and Electronics Engineers Inc. https://doi.org/10.1109/ITW.2003.1216739

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free