Logic design principles with emphasis on testable semicustom circuits
Logic design principles with emphasis on testable semicustom circuits
Fault-tolerant decoders for cyclic error-correcting codes
IEEE Transactions on Computers
Error-control coding for computer systems
Error-control coding for computer systems
Self-Checking Decoding Algorithm for Reed-Solomon Codes
Selected papers from the Workshop on Information Protection, Error Control, Cryptology, and Speech Compression
Strongly Fault Secure Logic Networks
IEEE Transactions on Computers
On Realizations of Boolean Functions Requiring a Minimal or Near-Minimal Number of Tests
IEEE Transactions on Computers
| Hi-index | 0.00 |
We consider problems of detecting errors in combinational circuits and algorithms for the decoding of linear codes. We show that a totally self-checking combinatorial circuit for the decoding of a binary Hamming [n, k] code can be constructed if and only if n = 2 r 驴 1, r = n驴k. We introduce the notion of a totally self-checking combinational circuit detecting error clusters of size at most µ; for shortened Hamming [n,k] codes, we construct totally self-checking decoding combinational circuits detecting error clusters of size at most µ, 2 驴 µ n驴k. We describe single-error protected and self-checking algorithms: the extended Euclidean algorithm and decoding algorithms for binary BCH codes and Reed-Solomon codes over GF(2 m ).