Systematic t-Error Correcting/All Unidirectional Error Detecting Codes
IEEE Transactions on Computers
An updated table of minimum-distance bounds for binary linear codes
IEEE Transactions on Information Theory
Error-Control Coding in Computers
Computer
Theory and Design of t-Error Correcting/d-Error Detecting (d
IEEE Transactions on Computers
IEEE Transactions on Computers
New Techniques for Constructing EC/AUED Codes
IEEE Transactions on Computers
An Improvement on Constructions of t-EC/AUED Codes
IEEE Transactions on Computers
On the Analysis and Design of Group Theoretical t-syEC/AUED Codes
IEEE Transactions on Computers
A Coding Approach for Detection of Tampering in Write-Once Optical Disks
IEEE Transactions on Computers
DCm Codes for Constructing t-EC/AUED Codes
IEEE Transactions on Computers
Multibit Correcting Data Interface for Fault-Tolerant Systems
IEEE Transactions on Computers
Constant Weight Codes for Correcting Symmetric Errors and Detecting Unidirectional Errors
IEEE Transactions on Computers
Asymmetric/Unidirectional Error Correcting and Detecting Codes
IEEE Transactions on Computers
Delay-Insensitive Pipelined Communication on Parallel Buses
IEEE Transactions on Computers
Unidirectional Bit/Byte Error Control
IEEE Transactions on Computers
IEEE Transactions on Computers
Self-exercising self testing k-order comparators
VTS '97 Proceedings of the 15th IEEE VLSI Test Symposium
Securing every bit: authenticated broadcast in radio networks
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
| Hi-index | 15.02 |
The authors present families of binary systematics codes that can correct t random errors and detect more than t unidirectional errors. The first step of the construction is encoding the k information symbols into a codeword of an (n', k, 2t+1) error-correcting code. The second step involves adding more bits to this linear error-correcting code in order to obtain the detection capability of all unidirectional errors. Asymmetric error-correcting codes turn out to be a powerful tool in the proposed construction. The resulting codes significantly improve previous results. Asymptotic estimates and decoding algorithms are presented.