On the Continued Fraction and Berlekamp’s Algorithm

IEEE Transactions on Information Theory

Volumn 30, Issue 3, 1984, Pages 541-544

  Cheng, Unjeng ^a  

^a AXIOMATIX ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES, SYMBOLIC;

EID: 0021424223     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1984.1056906     Document Type: Article

References (3)

1. E. R. Berlekamp, Algebraic Coding Theory. New York: McGraw-Hill, 1968, ch. 7.
2. I. S. Reed, R. A. Scholtz, T. K. Truong, and L. R. Welch, “The fast decoding of Reed-Solomon codes using Fermat theoretic transforms and continued fractions,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 100–106, Jan. 1978.
3. L. R. Welch and R. A. Scholtz, “Continued fractions and Berlekamp’s algorithm,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 19–27, Jan. 1979.