On decoding by error location and dependent sets of error positions

doi:10.1016/0012-365X(92)90567-Y

Discrete Mathematics

Volumes 106–107, 1 September 1992, Pages 369-381

https://doi.org/10.1016/0012-365X(92)90567-Y Get rights and content

Under an Elsevier user license

open archive

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.