Title :
Quasiperfect codes with small distance
Author :
Etzion, Tuvi ; Mounits, Beniamin
Author_Institution :
Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
fDate :
27 June-2 July 2004
Abstract :
The main purpose of this paper is to give bounds on the length of the shortest and longest binary quasiperfect codes with a given Hamming distance, covering radius, and redundancy. We consider codes with Hamming distance 4 and 5 and covering radius 2 and 3, respectively.
Keywords :
Hamming codes; binary codes; Hamming distance; binary quasiperfect code; code covering radius; code length; Binary codes; Computer science; Hamming distance; Linear code; Mathematics;
Conference_Titel :
Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
Print_ISBN :
0-7803-8280-3
DOI :
10.1109/ISIT.2004.1365490
