An improvement of the Griesmer bound for some small minimum distances
- 31 October 1985
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 12 (2) , 103-114
- https://doi.org/10.1016/0166-218x(85)90064-2
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- New constructions of codes meeting the Griesmer boundIEEE Transactions on Information Theory, 1983
- A new class of codes meeting the Griesmer boundIEEE Transactions on Information Theory, 1981
- A characterization of codes meeting the Griesmer boundInformation and Control, 1981
- Computerised search for linear binary codesElectronics Letters, 1976
- Binary codes with improved minimum weights (Corresp.)IEEE Transactions on Information Theory, 1976
- Further properties of linear binary anticodesElectronics Letters, 1974
- Minimum-distance bounds for binary linear codesIEEE Transactions on Information Theory, 1973
- Linear binary anticodesElectronics Letters, 1970
- A Bound for Error-Correcting CodesIBM Journal of Research and Development, 1960
- Design Methods for Maximum Minimum-Distance Error-Correcting CodesIBM Journal of Research and Development, 1960