Novel Totally Self-Checking Berger Code Checker Designs Based on Generalized Berger Code Partitioning
Issue No.08 - August (1993 vol.42)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.238498
<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>
totally self-checking Berger code checker designs; generalized Berger code partitioning; m-out-of-n checker; error correction codes; error detection codes.
G.L. Feng, T.R.N. Rao, J.C. Lo, "Novel Totally Self-Checking Berger Code Checker Designs Based on Generalized Berger Code Partitioning", IEEE Transactions on Computers, vol.42, no. 8, pp. 1020-1024, August 1993, doi:10.1109/12.238498