A simple Hankel interpretation of the Berlekamp-Massey algorithm (Q1825176): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 04:48, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple Hankel interpretation of the Berlekamp-Massey algorithm |
scientific article |
Statements
A simple Hankel interpretation of the Berlekamp-Massey algorithm (English)
0 references
1989
0 references
The Berlekamp-Massey algorithm is known for decoding Bose-Chaudhuri- Hocquengheim codes. In this paper it is provided an interpretation in the light of the algebraic theory of Hankel matrices. It is proved first that the jump of the linear feedback shift register length can be derived from the so-called Iohvidov index of the Hankel matrix. Next, the Hankel system of equations that yields the updated connection polynomial is solved via the LU factorization of the Hankel matrix.
0 references
Berlekamp-Massey algorithm
0 references
decoding Bose-Chaudhuri-Hocquengheim codes
0 references
Hankel matrices
0 references
linear feedback shift register length
0 references
Iohvidov index
0 references
Hankel system of equations
0 references
LU factorization of the Hankel matrix
0 references
