On correctable errors of binary linear codes
IEEE Transactions on Information Theory
| Hi-index | 754.90 |
For a binary linear code C of minimum distance d, if t>(d-1)/2, then there are errors of weight t which are not uniquely correctable. However, in many cases there are also errors of weight t which are uniquely correctable. The Newton radius of a code is defined to be the largest weight of a uniquely correctable error. Bounds and exact values of the Newton radius are given for several classes of codes