K. Imamura and W. Yoshida, "A simple derivation of the Berlekamp -- Massey algorithm and some applications", IEEE Trans. Inform. Theory 33, 1987, 146 -- 150. 13 Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Cryptanalysis of Stream Ciphered Digitized Voice - Gupta (2000) (Correct)
....be broken, then there is a brute force method that can lead us to breaking the ciphertext given reasonable limits on the noise in silence zones. Most implementations may use a Linear Feedback Shift Register (LSFR) or it s variants as their PRNG. These can be broken using some well known algorithms [5, 1, 6] if the random stream is available. We select a frame randomly, hoping that it is a class A frame, Then we generate all possible noise signals for the rst few bits, so that we can break the PRNG, and then test if the hypothesis holds for rest of the bits. If the attack is successful, we have ....
Wataru Yoshida Kyoki Imamura. A simple derivation of the berlekamp-massey algorithm and some applications. IEEE Trans. Information Theory, IT-33:146{ 150, january 1987.
Some Aspects of Hankel Matrices in Coding Theory and Combinatorics - Tamm (2001) (2 citations) (Correct)
....designed. This fact can be proved inductively as in [12] p. 374. An approach re ecting the mathematical background of these jumps via the Iohvidov index of the Hankel matrix or the block structure of the Pad e table is carried out by Jonckheere and Ma [44] Several authors (e.g. 45] p. 156, [43], 44] 13] point out that the proof of the above recurrence is quite complicated or that there is need for a transparent explanation. We shall see now that the analysis is much simpler for the case that all principle submatrices of the Hankel matrix A n are nonsingular. As a useful application, ....
....polynomials. Via (5.5) the three term recurrence can also be transferred to the case that calculations are carried out over nite elds. So, let us assume from now on that all principal submatrices A i , i n of the Hankel matrix A n are nonsingular. For this case, Imamura and Yoshida [43] demonstrated that j = j 1 = j 2 for even j and j = j j 1 = j 1 2 for odd j such that j is 1 if j is odd and 0 if j is even ( q 2j (x) u 2j (x) then are the convergents to F (x) This means that there are only two possible recursions for u j (x) depending on the parity of j, ....
K. Imamura and W. Yoshida, \A simple derivation of the Berlekamp { Massey algorithm and some applications", IEEE Trans. Inform. Theory 33, 1987, 146 - 150.
Some Aspects of Hankel Matrices in Coding Theory and Combinatorics - Tamm (2001) (2 citations) (Correct)
....designed. This fact can be proved inductively as in [12] p. 374. An approach reflecting the mathematical background of these jumps via the Iohvidov index of the Hankel matrix or the block structure of the Pade table is carried out by Jonckheere and Ma [44] Several authors (e.g. 45] p. 156, [43], 44] 13] point out that the proof of the above recurrence is quite complicated or that there is need for a transparent explanation. We shall see now that the analysis is much simpler for the case that all principle submatrices of the Hankel matrix A n are nonsingular. As a useful application, ....
....polynomials. Via (5.5) the three term recurrence can also be transferred to the case that calculations are carried out over finite fields. So, let us assume from now on that all principal submatrices A i , i # n of the Hankel matrix A n are nonsingular. For this case, Imamura and Yoshida [43] demonstrated that # j = # j 1 = j 2 for even j and # j = j # j 1 = j 1 2 for odd j such that # j is 1 if j is odd and 0 if j is even ( q 2j (x) u 2j (x) then are the convergents to F (x) This means that there are only two possible recursions for u j (x) depending on the parity of ....
K. Imamura and W. Yoshida, "A simple derivation of the Berlekamp -- Massey algorithm and some applications", IEEE Trans. Inform. Theory 33, 1987, 146 -- 150.
On the Quadratic Span of Binary Sequences - Youssef, Gong (2000) (Correct)
.... s q Gamma1 s q : s n Gammaq Gamma1 s n Gammaq Delta Delta Delta s n Gamma2 s n Gammaq Gamma1 s n Gammaq Delta Delta Delta s n Gammaq s nn Gamma2 Delta Delta Delta s n Gamma3 s n Gamma2 1 C C A We write the first q columns as the matrix A(n Gamma q; q) which is a Hankel matrix [8]) and the rest of columns as the matrix Delta(n Gamma q; q) So we have M (n Gamma q; q) A(n Gamma q; q) Delta(n Gamma q; q) Fact 1 The quadratic span of s n , 0 n N , is equal to q if and only if Rank(M (n Gamma q; q) Rank( A(n Gamma q; q 1) Delta(n Gamma q; q) ....
K.Imamura and W. Yoshida, A simple derivation of Berlekamp-Massey algorithm and some applications, IEEE transactions on Information Theory. Vol. 33. no. 1. pp. 146-150. January, 1987. 5
Hankel Matrices in Coding Theory and Combinatorics - Tamm (2000) (Correct)
No context found.
K. Imamura and W. Yoshida, "A simple derivation of the Berlekamp -- Massey algorithm and some applications", IEEE Trans. Inform. Theory 33, 1987, 146 -- 150. 13
Some Aspects of Hankel Matrices in Coding Theory and Combinatorics - Tamm (2001) (2 citations) (Correct)
No context found.
K. Imamura and W. Yoshida, "A simple derivation of the Berlekamp -- Massey algorithm and some applications", IEEE Trans. Inform. Theory 33, 1987, 146 -- 150.
An Extended Berlekamp-Massey Algorithm for the Inversion of.. - Henkel (1992) (4 citations) (Correct)
No context found.
K. Imamura and W. Yoshida, "A simple derivation of the Berlekamp-Massey algorithm and some applications," IEEE Trans. Inform. Theory, vol. IT-33, pp. 146-150, Jan. 1987.
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