On systematic single asymmetric error-correcting codes
- 1 March 2000
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 46 (2) , 669-672
- https://doi.org/10.1109/18.825839
Abstract
It is proved that for all values of code length n, except when n=2, 4, and 8 and possibly when n=2r and n=2r+1, where r⩾1, the Hamming codes are also optimal systematic single asymmetric error-correcting codes. For the cases n=2r and n=2 r+1, r⩾4, when not all information words are used, two efficient systematic 1-asymmetric codes are describedKeywords
This publication has 11 references indexed in Scilit:
- A lower bound on the undetected error probability and strictly optimal codesIEEE Transactions on Information Theory, 1997
- Bounds and constructions for binary codes of length less than 24 and asymmetric distance less than 6IEEE Transactions on Information Theory, 1988
- Systematic Unidirectional Error-Detecting CodesIEEE Transactions on Computers, 1985
- On Separable Unordered CodesIEEE Transactions on Computers, 1984
- Optimal asymmetric error detecting codesInformation and Control, 1982
- Upper bounds on codes correcting asymmetric errors (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
- Optimal error detection codes for completely asymmetric binary channelsInformation and Control, 1962
- A note on error detection codes for asymmetric channelsInformation and Control, 1961