• DocumentCode
    938837
  • Title

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

  • Author

    Cheng, Unjeng

  • Volume
    30
  • Issue
    3
  • fYear
    1984
  • fDate
    5/1/1984 12:00:00 AM
  • Firstpage
    541
  • Lastpage
    544
  • Abstract
    Continued fraction techniques are equivalent to Berlekamp\´s algorithm. The sequence D(k), k \\geq 0 , in Berlekamp\´s algorithm provides the information about when Berlekamp\´s algorithm completes one iterative step of the continued fraction. In fact, this happens when D(K) < k + 1/2 ; and when D(k) \\neq D(k + 1) , it implies that Berlekamp\´s algorithm begins the next iterative step of the continued fraction.
  • Keywords
    Coding/decoding; Continued fractions; Airports; Approximation algorithms; Decoding; Equations; Error correction codes; Iterative algorithms; Polynomials; Welding;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.1984.1056906
  • Filename
    1056906
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=938837