On upper bounds for unrestricted binary-error-correcting codes
- 1 July 1971
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 17 (4) , 466-478
- https://doi.org/10.1109/tit.1971.1054656
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Sphere-packing in the Hamming metricBulletin of the American Mathematical Society, 1969
- A class of optimum nonlinear double-error-correcting codesInformation and Control, 1968
- An optimum nonlinear codeInformation and Control, 1967
- Lower bounds to error probability for coding on discrete memoryless channels. IIInformation and Control, 1967
- Capabilities of Bounded Discrepancy DecodingBell System Technical Journal, 1965
- Improved asymptotic bounds for error-correcting codesIEEE Transactions on Information Theory, 1963
- A new upper bound for error-correcting codesIEEE Transactions on Information Theory, 1962
- Binary codes with specified minimum distanceIEEE Transactions on Information Theory, 1960
- On upper bounds for error detecting and error correcting codes of finite lengthIEEE Transactions on Information Theory, 1959
- Error Detecting and Error Correcting CodesBell System Technical Journal, 1950