Extension of the Berlekamp-Massey algorithm to N dimensions
Information and Computation
Continued fractions and Berlekamp-Massey algorithms
AUSCRYPT '90 Proceedings of the international conference on cryptology on Advances in cryptology
Sequences with almost perfect linear complexity profile
EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
Shift-register synthesis and BCH decoding
IEEE Transactions on Information Theory
Continued fractions and Berlekamp's algorithm
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Studies on the distribution of the shortest linear recurring sequences
Information Sciences: an International Journal
Multi-continued fraction algorithms and their applications to sequences
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
Levels of multi-continued fraction expansion of multi-formal Laurent series
Finite Fields and Their Applications
| Hi-index | 0.00 |
An iterative algorithm in solving the linear synthesis problem on multi-sequences over finite fields is derived from the multi-strict continued fraction algorithm (m-SCFA in short). It is interesting that the derived iterative algorithm is the same as the generalized Berlekamp-Massey algorithm (GBMA in short), though the computations in the m-SCFA and the GBMA are completely different. As a consequence, the minimal polynomials and the discrepancy sequence obtained by acting GBMA on a multi-sequence r@? are expressed explicitly by data associated to the multi-strict continued fraction expansion of r@?.