Title :
Optimal binary linear codes of length ⩽30
Author_Institution :
Dept. of Math. & Stat., Nebraska Univ., Lincoln, NE, USA
Abstract :
We classify optimal binary linear codes of length ⩽30. This paper summarizes the results. To do this, we utilize the author´s language Split. The body of this paper is a formal program in the Split language, which can be verified by execution. This paper builds on the work of numerous people, who have exhibited codes with particular parameters, or proved that they do not-exist
Keywords :
binary codes; linear codes; optimisation; Split language; codes length; codes parameter; formal program; optimal binary linear codes; Computer languages; Linear code; Page description languages; Web sites;
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.708596
