An updated table of minimum-distance bounds for binary linear codes
- 1 September 1987
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 33 (5) , 665-680
- https://doi.org/10.1109/tit.1987.1057356
Abstract
In 1973 Helgert and Sfinaff published a table of upper and lower bounds on the maximum minimum-distance for binary linear error-correcting codes up to length127. This article presents an updated table incorporating numerous improvements that have appeared since then. To simplify the updating task the author has developed a computer program that systematically investigates the consequences of each improvement by applying several well-known general code-construction techniques. This program also made it possible to check the original table. Furthermore, it offers a quick and reliable update service for future improvements.Keywords
This publication has 36 references indexed in Scilit:
- An improvement of the Griesmer bound for some small minimum distancesDiscrete Applied Mathematics, 1985
- A method for extending binary linear codes (Corresp.)IEEE Transactions on Information Theory, 1984
- Good linear codes of length 27 and 28 (Corresp.)IEEE Transactions on Information Theory, 1980
- Concatenated codes with large minimum distance (Corresp.)IEEE Transactions on Information Theory, 1977
- Further results on Goppa codes and their applications to constructing efficient binary codesIEEE Transactions on Information Theory, 1976
- Shortened BCH codes (Corresp.)IEEE Transactions on Information Theory, 1973
- A (48, 31, 8) linear code (Corresp.)IEEE Transactions on Information Theory, 1973
- Minimum-distance bounds for binary linear codesIEEE Transactions on Information Theory, 1973
- New binary codesIEEE Transactions on Information Theory, 1972
- Group code equivalence and optimum codesIEEE Transactions on Information Theory, 1959