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

Authors

T. R.N. Rao, University of Louisiana at Lafayette
Gui Liang Feng, University of Louisiana at Lafayette
M. Mahadev, University of Louisiana at Lafayette
S. Kolluru, University of Louisiana at Lafayette
Jien Chung Lo, University of Rhode Island

Document Type

Article

Date of Original Version

1-1-1993

Abstract

Novel totally self-checking (TSC) Berger code checker designs 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. © 1993 IEEE

Publication Title, e.g., Journal

IEEE Transactions on Computers

Volume

42

Issue

8

Citation/Publisher Attribution

Rao, T. R., Gui Liang Feng, M. Mahadev, S. Kolluru, and Jien Chung Lo. "Novel Totally Self-Checking Berger Code Checker Designs Based on Generalized Berger Code Partitioning." IEEE Transactions on Computers 42, 8 (1993): 1020-1024. doi: 10.1109/12.238498.