Title :
The Newton radius of codes
Author :
Helleseth, Tor ; Kløve, Torleiv
Author_Institution :
Dept. of Inf., Bergen Univ., Norway
fDate :
11/1/1997 12:00:00 AM
Abstract :
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
Keywords :
Reed-Muller codes; binary sequences; decoding; error correction codes; linear codes; Newton radius; binary linear code; bounds; code classes; decoding; equidistant codes; exact values; first-order Reed-Muller codes; minimum distance; uniquely correctable errors; weight errors; Councils; Decoding; Error correction; Error correction codes; Informatics; Information theory; Linear code; Upper bound; Vectors;
Journal_Title :
Information Theory, IEEE Transactions on
