New Lower Bounds of the Size of Error-Correcting Codes for the Z-Channel
Author:
- 1 January 2002
- journal article
- Published by Springer Nature in Cybernetics and Systems Analysis
- Vol. 38 (1) , 13-16
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Greedy and heuristic algorithms for codes and coloringsIEEE Transactions on Information Theory, 1998
- New lower bounds for asymmetric and unidirectional codesIEEE Transactions on Information Theory, 1991
- A new table of constant weight codesIEEE Transactions on Information Theory, 1990
- New lower bounds for constant weight codesIEEE Transactions on Information Theory, 1989
- Bounds and constructions for binary asymmetric error-correcting codes (Corresp.)IEEE Transactions on Information Theory, 1981
- On the theory of binary asymmetric error correcting codesInformation and Control, 1979
- A class of codes for asymmetric channels and a problem from the additive theory of numbersIEEE Transactions on Information Theory, 1973