The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (1987 vol.36)
pp: 629-634
S.J. Piestrak , Department of Computer Science, University of Georgia
ABSTRACT
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
INDEX TERMS
unordered codes, Berger code, concurrent error detection, fault detection, m-out-of-n code checkers, self-checking circuits, self-testing checkers, unidirectional errors
CITATION
S.J. Piestrak, "Design of Fast Self-Testing Checkers for a Class of Berger Codes", IEEE Transactions on Computers, vol.36, no. 5, pp. 629-634, May 1987, doi:10.1109/TC.1987.1676949
21 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool