New bounds on binary linear codes of dimension eight (Corresp.)
- 1 November 1987
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 33 (6) , 917-919
- https://doi.org/10.1109/tit.1987.1057363
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- An improvement of the Griesmer bound for some small minimum distancesDiscrete Applied Mathematics, 1985
- Some new two-weight codes and strongly regular graphsDiscrete Applied Mathematics, 1985
- New constructions of codes meeting the Griesmer boundIEEE Transactions on Information Theory, 1983
- The smallest length of binary 7–dimensional linear codes with prescribed minimum distanceDiscrete Mathematics, 1981
- A new class of codes meeting the Griesmer boundIEEE Transactions on Information Theory, 1981
- On quasi-cyclic codes with rate l m (Corresp.)IEEE Transactions on Information Theory, 1978
- Further results on Goppa codes and their applications to constructing efficient binary codesIEEE Transactions on Information Theory, 1976
- 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
- Computer results on the minimum distance of some binary cyclic codes (Corresp.)IEEE Transactions on Information Theory, 1970