A New Random-Error-Correction Code

A new random-error-correction code presented here is one of the most efficient two-error-correction codes. The new code can correct 2-bit random errors within twelve (12) consecutive bits while (15,7) BCH code [1] corrects two errors within fifteen (15) bits and Hagelbarger's code [2] corrects two errors within fourteen (14) bits. Although Peterson and Weldon's double-error-correcting (12,6) code [1] and Massey's two-error-correcting convolutional code [3] also correct two errors within twelve (12) bits, both codes propagate errors. The (12,6) Viterbi code [1], [4] corrects two errors and uses a Viterbi decoder, while the new code is decodable with a one-step majority logic. Error propagation in the feedback majority logic decoder is discussed, and it is proved empirically that the new code presented here does not propagate errors.