Title :
On a bound involving the covering radius and the Newton radius
Author :
Gabidulin, Ernst ; Klove, Torleiv
Author_Institution :
Moscow Inst. of Phys. & Technol., Russia
Abstract :
An error e is (uniquely) correctable if and only if it is the unique coset leader in its coset. The study of unique coset leaders is therefore important when one wants to study decoding beyond half the minimum distance. The covering radius is the largest weight of a coset leader. The author examines a binary linear code. They show a nontrivial relation involving the Newton and covering radii
Keywords :
binary codes; decoding; linear codes; Newton radius; binary linear code; bound; coset leader weight; covering radius; decoding; error correction; minimum distance; unique coset leader; Councils; Error correction codes; Informatics;
Conference_Titel :
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Conference_Location :
Cambridge, MA
Print_ISBN :
0-7803-5000-6
DOI :
10.1109/ISIT.1998.709038
