Minimum-distance bounds for binary linear codes
Authors:
- H. HelgertHHH. Helgert
- R. StinaffRSR. Stinaff
- 1 May 1973
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 19 (3) , 344-356
Abstract
This paper presents a table of upper and lower bounds ond_{max} (n,k), the maximum minimum distance over all binary, linear(n,k)error-correcting codes. The table is obtained by combining the best of the existing bounds ond_{max} (n,k)with the minimum distances of known codes and a variety of code-construction techniques.Keywords
This publication has 22 references indexed in Scilit:
- A survey of constructive coding theory, and a table of binary codes of highest known rateDiscrete Mathematics, 1972
- Srivastava codesIEEE Transactions on Information Theory, 1972
- New family of single-error correcting codesIEEE Transactions on Information Theory, 1970
- Computer results on the minimum distance of some binary cyclic codes (Corresp.)IEEE Transactions on Information Theory, 1970
- Some Remarks on BCH Bounds and Minimum Weights of Binary Primitive BCH CodesIEEE Transactions on Information Theory, 1969
- Polynomial codesIEEE Transactions on Information Theory, 1968
- Analysis of weight distribution in binary cyclic codes (Corresp.)IEEE Transactions on Information Theory, 1966
- A search technique for quasi-perfect codesInformation and Control, 1966
- Binary codes with specified minimum distanceIEEE Transactions on Information Theory, 1960
- A Comparison of Signalling AlphabetsBell System Technical Journal, 1952