A description of the [16,7,6] codes
Part of the Lecture Notes in Computer Science book series (LNCS, volume 508)
Submitted Contributions Error Correcting Codes: Theory And Applications
- 154 Downloads
The paper gives a description of the three binary linear [16,7,6] codes by linking these codes to certain semilinear spaces. The basic technique is repeated puncturing and shortening.
KeywordsSymmetry Group Weight Distribution Linear Code Coordinate Position Dual Code
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 1.Th. Beth, D. Jungnickel and H. Lenz, Design Theory (B.I.-Wissenschaftsverlag, Mannheim, 1985).Google Scholar
- 2.B.K. Kostova and N.L. Manev, A [25,8,10] code does not exist, preprint.Google Scholar
- 3.F.J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes (North-Holland, New York, 1983).Google Scholar
- 4.H. van Tilborg, On the uniqueness resp. nonexistence of certain codes meeting the Griesmer bound, Information and Control 44 (1980), 16–35.Google Scholar
- 5.H. van Tilborg, The smallest length of binary 7-dimensional linear codes with prescribed minimum distance., Discrete Mathematics 33 (1981), 197–207.Google Scholar
- 6.T. Verhoeff, An updated table of minimum-distance bounds for binary linear codes, IEEE Transactions on Information Theory 33 (1987) 665–680.Google Scholar
- 7.Ø. Ytrehus and T. Helleseth, There is no binary [25,8,10] code, IEEE Transactions on Information Theory 36 (1990) 695–696.Google Scholar
© Springer-Verlag Berlin Heidelberg 1991