Decoding cyclic and BCH codes up to actual minimum distance using nonrecurrent syndrome dependence relations (Q3987474)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decoding cyclic and BCH codes up to actual minimum distance using nonrecurrent syndrome dependence relations |
scientific article |
Statements
Decoding cyclic and BCH codes up to actual minimum distance using nonrecurrent syndrome dependence relations (English)
0 references
28 June 1992
0 references
cyclic coding
0 references
BCH coding
0 references
decoding up to actual minimum distance
0 references
decoding capabilities of algebraic algorithms
0 references
Berlekamp-Massey algorithm
0 references
Euclidean algorithm
0 references
minimum distance bounds
0 references
error-correcting capability
0 references
Peterson decoding procedure
0 references
error-locator polynomial
0 references
nonrecurrent syndrome dependence relations
0 references
generalization of Peterson's procedure
0 references
