Continued fractions and the Berlekamp-Massey algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 453 LNCS, Issue , 1990, Pages 24-31

  Dai, Zongduo ^a   Zeng, Kencheng ^b,c  

^a LINKÖPING UNIVERSITY   (Sweden)

^b UNIVERSITY OF LOUISIANA AT LAFAYETTE   (United States)

^c UNIVERSITY OF CHINESE ACADEMY OF SCIENCES   (China)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY SEQUENCES; BINS; CRYPTOGRAPHY;

BERLEKAMP; BERLEKAMP-MASSEY ALGORITHM; BINARY FIELDS; CLASSICAL PROBLEMS; CONTINUED FRACTION; FORMAL LAURENT SERIES; RATIONAL APPROXIMATIONS; SYNTHESIS ALGORITHMS;

APPROXIMATION ALGORITHMS;

EID: 0010955122     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0030347     Document Type: Conference Paper

References (3)

1. J. W. Cassels, Diophantine Approximation, Cambridge University Press, London, 1965.
2. J. L. Massey, “Shift-Register Synthesis and BCH Decoding”, IEEE Trans. Info. Th., Vol. IT-15, pp. 122-127, Jan. 1969.
3. W.H. Mills, “Continued Fractions and Linear Recurrence”, Math. Comp., 29(1975), pp. 173-180.