Samenvatting
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.
Originele taal-2 | Engels |
---|---|
Pagina's (van-tot) | 369-381 |
Aantal pagina's | 13 |
Tijdschrift | Discrete Mathematics |
Volume | 106-107 |
Nummer van het tijdschrift | 1 |
DOI's | |
Status | Gepubliceerd - 1992 |