Abstract
We generalize the existing decoding algorithms by error location for BCH and algebraic-geometric codes to arbitrary linear codes. We investigate the number of dependent sets of error positions. A received word with an independent set of error positions can be corrected.
Original language | English |
---|---|
Pages (from-to) | 369-381 |
Number of pages | 13 |
Journal | Discrete Mathematics |
Volume | 106-107 |
Issue number | 1 |
DOIs | |
Publication status | Published - 1992 |