The Community for Technology Leaders
Green Image
ABSTRACT
<p>Totally self-checking (TSC) Berger code checker designs are presented. The generalized Berger check partitioning is derived. It is proven that a TSC Berger code checker can be constructed from a TSC m-out-of-n checker. For a TSC Berger code checker design, no two-output checker exists for information length 2/sup r-1/, for any positive nonzero r. The presented approach solves this open problem.</p>
INDEX TERMS
totally self-checking Berger code checker designs; generalized Berger code partitioning; m-out-of-n checker; error correction codes; error detection codes.
CITATION

M. Kolluru, G. Feng, T. Rao and J. Lo, "Novel Totally Self-Checking Berger Code Checker Designs Based on Generalized Berger Code Partitioning," in IEEE Transactions on Computers, vol. 42, no. , pp. 1020-1024, 1993.
doi:10.1109/12.238498
96 ms
(Ver 3.3 (11022016))