Advertisement

Continued fractions and the Berlekamp-Massey algorithm

  • Zongduo Dai
  • Kencheng Zeng
Section 2 Pseudorandomness And Sequences I
Part of the Lecture Notes in Computer Science book series (LNCS, volume 453)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Zongduo Dai
    • 1
  • Kencheng Zeng
    • 2
  1. 1.Department of Electronic EngineeringUniversity of LinköpingLinköpingSweden
  2. 2.Center for Advanced Computer StudiesUniversity of Southwestern LouisianaLafayette

Personalised recommendations