The Community for Technology Leaders
Green Image
Issue No. 05 - May (1987 vol. 36)
ISSN: 0018-9340
pp: 629-634
S.J. Piestrak , Department of Computer Science, University of Georgia
The Berger codes are optimal separable codes that detect all undirectional errors. In this correspondence a new procedure of designing self-testing checkers (STC's) for codes with I information bits, where I = {2<sup>K</sup>-2, 2<sup>K</sup>-l} and I = 3, is proposed. I = 3. The new checker is basically composed of u = ?(I + 1)/2? STC's for m-out-of-n codes with n = I + 1 and m = 2p + 1, O = p = u
unordered codes, Berger code, concurrent error detection, fault detection, m-out-of-n code checkers, self-checking circuits, self-testing checkers, unidirectional errors

S. Piestrak, "Design of Fast Self-Testing Checkers for a Class of Berger Codes," in IEEE Transactions on Computers, vol. 36, no. , pp. 629-634, 1987.
83 ms
(Ver 3.3 (11022016))