A new upper bound on nonbinary block codes
- 1 August 1990
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 83 (2-3) , 139-160
- https://doi.org/10.1016/0012-365x(90)90002-y
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- On the Nonbinary Johnson SchemeEuropean Journal of Combinatorics, 1985
- Notes on the asymptotic behavior of the information rate of block codes (Corresp.)IEEE Transactions on Information Theory, 1984
- Modular curves, Shimura curves, and Goppa codes, better than Varshamov‐Gilbert boundMathematische Nachrichten, 1982
- Linear programming bounds for tree codes (Corresp.)IEEE Transactions on Information Theory, 1979
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalitiesIEEE Transactions on Information Theory, 1977
- Maximum distanceq-nary codesIEEE Transactions on Information Theory, 1964
- Binary codes with specified minimum distanceIEEE Transactions on Information Theory, 1960
- A Comparison of Signalling AlphabetsBell System Technical Journal, 1952
- Error Detecting and Error Correcting CodesBell System Technical Journal, 1950