Design of Fast Self-Testing Checkers for a Class of Berger Codes

  • Authors:
  • S. J. Piestrak

  • Affiliations:
  • Univ. of Georgia, Athens

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 1987

Quantified Score

Hi-index 15.00

Visualization

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 = {2K-2, 2K-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