On the continued fraction and Berlekamp's algorithm (Corresp.)

DOI10.1109/TIT.1984.1056906zbMath0552.94014OpenAlexW2013220782MaRDI QIDQ3346223

Unjeng Cheng

Publication date: 1984

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.1984.1056906

zbMATH Keywords

formal power seriescontinued fraction algorithmBerlekamp's algorithm

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Continued fractions (11A55) Radix representation; digital problems (11A63) Decoding (94B35)

Related Items (6)

Feedback shift registers, 2-adic span, and combiners with memory ⋮ Univariate polynomial factorization over finite fields ⋮ Refined convergents to the associated continued fractions for binary sequences ⋮ On sequences, rational functions and decomposition ⋮ Berlekamp-Massey algorithm, continued fractions, Padé approximations, and orthogonal polynomials ⋮ The Berlekamp-Massey algorithm revisited

This page was built for publication: On the continued fraction and Berlekamp's algorithm (Corresp.)