Novel Totally Self-checking Berger Code Checker Designs Based on Generalized Berger Code Partitioning

Novel totally self-checking (TSC) Berger code checker de- signs are presented in this correspondence. We derive the generalized Berger check partitioning and prove 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 2r-1 , for any positive nonzero r. The presented approach solves this open problem. Index Terms-Generalized Berger code partitioning, m-out-of-n code, self-checking Berger code checker, two-output TSC Berger checker de- sign.