L. R. Welch and R. A. Scholtz, "Continued fractions and Berlekamp's algorithm", IEEE Trans. Inform. Theory 25, 1979, 19 -- 27. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Some Aspects of Hankel Matrices in Coding Theory and Combinatorics - Tamm (2001) (2 citations) (Correct)
.... A decoding procedure based on continued fractions for separable Goppa codes was presented by Goppa in [34] and later for general Goppa codes in [35] The relation of Berlekamp s algorithm to continued fraction techniques was pointed out by Mills [49] and thoroughly studied by Welch and Scholtz [79]. Cheng [20] analysed that the sequence j provides the information when Berlekamp s algorithm completes one iterative step of the continued fraction, which happens when j j 1 2 and when j 6= j 1 . This means that if this latter condition is ful lled, the polynomials q j (x) and u j ....
L. R. Welch and R. A. Scholtz, \Continued fractions and Berlekamp's algorithm", IEEE Trans. Inform. Theory 25, 1979, 19 - 27.
Some Aspects of Hankel Matrices in Coding Theory and Combinatorics - Tamm (2001) (2 citations) (Correct)
.... A decoding procedure based on continued fractions for separable Goppa codes was presented by Goppa in [34] and later for general Goppa codes in [35] The relation of Berlekamp s algorithm to continued fraction techniques was pointed out by Mills [49] and thoroughly studied by Welch and Scholtz [79]. Cheng [20] analysed that the sequence # j provides the information when Berlekamp s algorithm completes one iterative step of the continued fraction, which happens when # j j 1 2 and when # j #= # j 1 . This means that if this latter condition is fulfilled, the polynomials q j (x)andu j ....
L. R. Welch and R. A. Scholtz, "Continued fractions and Berlekamp's algorithm", IEEE Trans. Inform. Theory 25, 1979, 19 -- 27.
Feedback Shift Registers, 2-Adic Span, and Combiners with Memory - Klapper, Goresky (1996) (Correct)
....previously determined LFSR. Thus the number of available bits does not need to be known ahead of time. The Berlekamp Massey algorithm is equivalent to finding the continued fraction expansion in the field Z= 2) X] of formal power series, of the element A(X) P 1 i=0 a i X i 2 Z= 2) X] [7, 9, 40, 48]. One might hope that the continued fraction expansion in the field Q 2 of 2 adic numbers of the element ff = P 1 i=0 a i 2 i would exhibit similar optimality properties, but this is false. In fact, the continued fraction expansion may fail to converge properly (cf. 47] There are a number ....
L. R. Welch and R. A. Scholtz, Continued fractions and Berlekamp's algorithm. IEEE Trans. Info. Theory vol. 25, 1979 pp. 19-27. 41
Shift-Register Synthesis (Modulo m) - Reeds, Sloane (1985) (Correct)
.... the shortest linear recurrence (or linear feedback shift register) that will generate the sequence ( 1, Chapter 7] 21] The algorithm can be used to decode other codes ( 18] 20] 23] 27] 32] is related to the Euclidean algorithm and the computation of Pade approximations ( 6] 7] 22] [34]) and has been extensively studied ( 2] 8] 10] 13] 26] 33] 35] W. F. Lunnon, in an unpublished manuscript [17] has pointed out that a version of the quotient difference algorithm ( 12] 14] 15] can be used to find the shortest linear recurrence which generates a given sequence of ....
L. R. Welch and R. A. Scholtz, Continued fractions and Berlekamp's algorithm, IEEE Trans. Information Theory, IT-25 (1979), 19-27.
Hankel Matrices in Coding Theory and Combinatorics - Tamm (2000) (Correct)
No context found.
L. R. Welch and R. A. Scholtz, "Continued fractions and Berlekamp's algorithm", IEEE Trans. Inform. Theory 25, 1979, 19 -- 27.
Feedback Shift Registers, 2-Adic Span, and Combiners with Memory - Klapper, al. (1997) (Correct)
No context found.
L. R. Welch and R. A. Scholtz, Continued fractions and Berlekamp's algorithm, IEEE Trans. Inform. Theory, vol. 25, 1979 pp. 19--27.
Some Aspects of Hankel Matrices in Coding Theory and Combinatorics - Tamm (2001) (2 citations) (Correct)
No context found.
L. R. Welch and R. A. Scholtz, "Continued fractions and Berlekamp's algorithm", IEEE Trans. Inform. Theory 25, 1979, 19 -- 27.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC