NOVEL TOTALLY SELF-CHECKING BERGER CODE CHECKER DESIGNS BASED ON GENERALIZED BERGER CODE PARTITIONING

Authors
RAO TRN FENG GL KOLLURU MS LO JC
Citation
Trn. Rao et al., NOVEL TOTALLY SELF-CHECKING BERGER CODE CHECKER DESIGNS BASED ON GENERALIZED BERGER CODE PARTITIONING, I.E.E.E. transactions on computers, 42(8), 1993, pp. 1020-1024
Citations number
17
Categorie Soggetti
Computer Sciences","Engineering, Eletrical & Electronic","Computer Applications & Cybernetics
Journal title
I.E.E.E. transactions on computers → ACNP
ISSN journal
00189340
Volume
42
Issue
8
Year of publication
1993
Pages
1020 - 1024
Database
ISI
SICI code
0018-9340(1993)42:8<1020:NTSBCC>2.0.ZU;2-M
Abstract
Novel totally self-checking (TSC) Berger code checker designs are pres ented in this correspondence. We derive the generalized Berger check p artitioning and prove that a TSC Berger code checker can be constructe d 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 pos itive nonzero r. The presented approach solves this open problem.