Continued fractions and the Berlekamp-Massey algorithm

DOI10.1007/BFb0030347zbMath0749.41016OpenAlexW2130129774MaRDI QIDQ3972877

Kencheng Zeng, Zongduo Dai

Publication date: 26 June 1992

Published in: Advances in Cryptology — AUSCRYPT '90 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0030347

zbMATH Keywords

binary sequencesrational approximationformal Laurent seriesBerlekamp-Masseylinear synthesis algorithm

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Approximation by rational functions (41A20)

Related Items (6)

Feedback shift registers, 2-adic span, and combiners with memory ⋮ Linear recurring sequences over rings and modules ⋮ An application of a qd‐type discrete hungry Lotka–Volterra equation over finite fields to a decoding problem ⋮ Berlekamp-Massey algorithm, continued fractions, Padé approximations, and orthogonal polynomials ⋮ Multi-continued fraction algorithm and generalized B--M algorithm over \(\mathbb F_{q}\) ⋮ Decoding algorithm as a moment problem related to the extended Lotka–Volterra system

This page was built for publication: Continued fractions and the Berlekamp-Massey algorithm