New binary codes
- 1 July 1972
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 18 (4), 503-510
- https://doi.org/10.1109/tit.1972.1054833
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- A survey of constructive coding theory, and a table of binary codes of highest known rateDiscrete Mathematics, 1972
- On upper bounds for unrestricted binary-error-correcting codesIEEE Transactions on Information Theory, 1971
- On decoding iterated codesIEEE Transactions on Information Theory, 1970
- Computer results on the minimum distance of some binary cyclic codes (Corresp.)IEEE Transactions on Information Theory, 1970
- Quasi-self-reciprocal polynomials and potentially large minimum distance BCH codesIEEE Transactions on Information Theory, 1969
- On the uniqueness of the Golay codesJournal of Combinatorial Theory, 1968
- A class of optimum nonlinear double-error-correcting codesInformation and Control, 1968
- Weight and distance structure of Nordstrom-Robinson quadratic codeInformation and Control, 1968
- The weight structure of some Bose-Chaudhuri codes (Corresp.)IEEE Transactions on Information Theory, 1968
- Bounds for exponential sumsDuke Mathematical Journal, 1957