DocumentCode
2497666
Title
An algorithm for computing a shortest linear recurrence relation for a sequence of matrices: generalizing the Berlekamp-Massey algorithm
Author
Kuijper, Margreet ; Willems, Jan C.
Author_Institution
Dept. of Electr. & Electron. Eng., Melbourne Univ., Parkville, Vic., Australia
fYear
1998
fDate
16-21 Aug 1998
Firstpage
441
Abstract
The Berlekamp-Massey algorithm (1968) iteratively constructs a shortest linear recurrence relation for a finite sequence of numbers. Here we present a system-theoretic explanation of the algorithm as well as an extension that constructs a shortest linear recurrence relation for a finite sequence of matrices, rather than numbers
Keywords
cryptography; iterative methods; matrix algebra; sequences; Berlekamp-Massey algorithm; cryptography; finite sequence of matrices; shortest linear recurrence relation; system-theoretic explanation; Algorithm design and analysis; Councils; Cryptography; Error correction codes; Iterative algorithms; Iterative decoding; Polynomials; Reed-Solomon codes; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Conference_Location
Cambridge, MA
Print_ISBN
0-7803-5000-6
Type
conf
DOI
10.1109/ISIT.1998.709046
Filename
709046
Link To Document