Title :
Computing Extensions of Linear Codes
Author_Institution :
Inst. fur Algorithmen und Kognitive Syst. Fak. fur Inf., Univ. Karlsruhe, Karlsruhe
Abstract :
This paper deals with the problem of increasing the minimum distance of a linear code by adding one or more columns to the generator matrix. Several methods to compute extensions of linear codes are presented. Many codes improving the previously known lower bounds on the minimum distance have been found.
Keywords :
linear codes; matrix algebra; generator matrix; linear codes extension; minimum distance problem; Algebra; Distributed computing; Encoding; Linear code; Parity check codes; Upper bound; Vectors;
Conference_Titel :
Information Theory, 2007. ISIT 2007. IEEE International Symposium on
Conference_Location :
Nice
Print_ISBN :
978-1-4244-1397-3
DOI :
10.1109/ISIT.2007.4557095
