A fast algorithm to determine the burst-correcting limit of cyclic or shortened cyclic codes (Q3990790)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A fast algorithm to determine the burst-correcting limit of cyclic or shortened cyclic codes |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast algorithm to determine the burst-correcting limit of cyclic or shortened cyclic codes |
scientific article |
Statements
A fast algorithm to determine the burst-correcting limit of cyclic or shortened cyclic codes (English)
0 references
28 June 1992
0 references
Berlekamp-Massey algorithm
0 references
invariant theory
0 references
burst-correcting limit
0 references
cyclic code
0 references
linear complexity
0 references
