On the minimal redundancy of binary error-correcting codes
- 31 August 1975
- journal article
- Published by Elsevier in Information and Control
- Vol. 28 (4), 268-291
- https://doi.org/10.1016/s0019-9958(75)90300-9
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Upper bounds on the cardinality of a binary code with a given minimum distanceInformation and Control, 1975
- A class of low-rate nonlinear binary codesInformation and Control, 1972
- A new upper bound for error-correcting codesIEEE Transactions on Information Theory, 1962
- A Comparison of Signalling AlphabetsBell System Technical Journal, 1952