Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Th. Beth, D. Jungnickel and H. Lenz, Design Theory (B.I.-Wissenschaftsverlag, Mannheim, 1985).
B.K. Kostova and N.L. Manev, A [25,8,10] code does not exist, preprint.
F.J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes (North-Holland, New York, 1983).
H. van Tilborg, On the uniqueness resp. nonexistence of certain codes meeting the Griesmer bound, Information and Control 44 (1980), 16–35.
H. van Tilborg, The smallest length of binary 7-dimensional linear codes with prescribed minimum distance., Discrete Mathematics 33 (1981), 197–207.
T. Verhoeff, An updated table of minimum-distance bounds for binary linear codes, IEEE Transactions on Information Theory 33 (1987) 665–680.
Ø. Ytrehus and T. Helleseth, There is no binary [25,8,10] code, IEEE Transactions on Information Theory 36 (1990) 695–696.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Simonis, J. (1991). A description of the [16,7,6] codes. In: Sakata, S. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1990. Lecture Notes in Computer Science, vol 508. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54195-0_36
Download citation
DOI: https://doi.org/10.1007/3-540-54195-0_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54195-0
Online ISBN: 978-3-540-47489-0
eBook Packages: Springer Book Archive