An improvement of the Gilbert bound for constant weight codes (Corresp.)
- 1 September 1987
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 33 (5) , 721-723
- https://doi.org/10.1109/tit.1987.1057344
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Generalized Reed - Solomon codes from algebraic geometryIEEE Transactions on Information Theory, 1987
- A note on lower bounds (Corresp.)IEEE Transactions on Information Theory, 1986
- Modular curves and codes with a polynomial constructionIEEE Transactions on Information Theory, 1984
- Modular curves, Shimura curves, and Goppa codes, better than Varshamov‐Gilbert boundMathematische Nachrichten, 1982
- Lower bounds for constant weight codesIEEE Transactions on Information Theory, 1980
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalitiesIEEE Transactions on Information Theory, 1977
- Upper bounds for constant weight error correcting codesDiscrete Mathematics, 1972
- Nonrandom binary superimposed codesIEEE Transactions on Information Theory, 1964
- A new upper bound for error-correcting codesIEEE Transactions on Information Theory, 1962
- A Comparison of Signalling AlphabetsBell System Technical Journal, 1952