Title :
Binary and Ternary Linear Quasi-Perfect Codes With Small Dimensions
Author :
Baicheva, Tsonka ; Bouyukliev, Iliya ; Dodunekov, Stefan ; Fack, Veerle
Author_Institution :
Inst. of Math. & Inf., Bulgarian Acad. of Sci., Tarnovo
Abstract :
The aim of this work is a systematic investigation of the possible parameters of quasi-perfect (QP) binary and ternary linear codes of small dimensions and preparing a complete classification of all such codes. First, we give a list of infinite families of QP codes which includes all binary, ternary, and quaternary codes known to us. We continue further with a list of sporadic examples of binary and ternary QP codes. Later we present the results of our investigation where binary QP codes of dimensions up to 14 and ternary QP codes of dimensions up to 13 are classified.
Keywords :
binary codes; linear codes; ternary codes; binary linear quasi perfect code; infinite family; small dimension; ternary linear quasi perfect code; Associate members; Galois fields; Hamming distance; Hamming weight; Informatics; Linear code; Mathematics; Parity check codes; Quadratic programming; Vectors; Classification of codes; covering radius; linear codes; quasi-perfect codes;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2008.928277
