Bounds and constructions for codes correcting unidirectional errors
- 1 July 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 35 (4) , 797-810
- https://doi.org/10.1109/18.32156
Abstract
A brief introduction is given on the theory of codes correcting unidirectional errors, in the context of symmetric and asymmetric error-correcting codes. Upper bounds on the size of a code of length n correcting t or fewer unidirectional errors are then derived. Methods in which codes correcting up to t unidirectional errors are constructed by expurgating t-fold asymmetric error-correcting codes or by expurgating and puncturing t -fold symmetric error-correcting codes are also presented. Finally, tables summarizing some results on the size of optimal unidirectional error-correcting codes which follow from these bounds and constructions are givenKeywords
This publication has 15 references indexed in Scilit:
- Systematic t-Error Correcting/All Unidirectional Error Detecting CodesIEEE Transactions on Computers, 1986
- Optimal Unidirectional Error Detecting/Correcting CodesIEEE Transactions on Computers, 1982
- Theory of Unidirectional Error Correcting/Detecting CodesIEEE Transactions on Computers, 1982
- The smallest length of binary 7–dimensional linear codes with prescribed minimum distanceDiscrete Mathematics, 1981
- Bounds and constructions for binary asymmetric error-correcting codes (Corresp.)IEEE Transactions on Information Theory, 1981
- On the (23,14,5) Wagner code (Corresp.)IEEE Transactions on Information Theory, 1980
- A New Class of Error-Correcting/Detecting Codes for Fault-Tolerant Computer ApplicationsIEEE Transactions on Computers, 1980
- Lower bounds for constant weight codesIEEE Transactions on Information Theory, 1980
- New binary codesIEEE Transactions on Information Theory, 1972
- A search technique for quasi-perfect codesInformation and Control, 1966