The smallest length of binary 7–dimensional linear codes with prescribed minimum distance
- 31 December 1981
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 33 (2) , 197-207
- https://doi.org/10.1016/0012-365x(81)90166-7
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- On the uniqueness resp. Nonexistence of certain codes meeting the Griesmer boundInformation and Control, 1980
- On quasi-cyclic codes with rate l m (Corresp.)IEEE Transactions on Information Theory, 1978
- Binary codes with improved minimum weights (Corresp.)IEEE Transactions on Information Theory, 1976
- Minimum-distance bounds for binary linear codesIEEE Transactions on Information Theory, 1973
- A note on the Griesmer bound (Corresp.)IEEE Transactions on Information Theory, 1973
- Computer results on the minimum distance of some binary cyclic codes (Corresp.)IEEE Transactions on Information Theory, 1970
- Algebraically punctured cyclic codesInformation and Control, 1965
- A Bound for Error-Correcting CodesIBM Journal of Research and Development, 1960