Soft decoding of the (23, 12, 7) Golay-code up to five errors

Buy article PDF

Abstract

A new decoder is proposed to decode the (23, 12, 7) binary Golay-code up to five errors. It is based on the algorithm that can correct up to four errors for the (24, 12, 8) extended Golay-code proposed by Lin et al., thereby achieving the soft decoding in the real sense for the Golay-code. For a weight-2 or weight-3 error pattern decoded by the hard decoder for correcting up to three errors, one can find the corresponding 21 weight-4 or weight-5 error patterns and choose the one with the maximum emblematic probability value, which is defined as the product of individual bit-error probabilities corresponding to the non-zero locations of the error pattern as the ultimate choice. Finally, simulation results of this decoder over additive white Gaussian noise (AWGN) channels show that the proposed method provides 0.9 dB coding gain than that of Lin et al.'s algorithm at bit-error rate of 10−5.

References

    1. 1)
    2. 2)
      • McEliece, R.: Theory of information and coding, 1977 (Addison Wesley)
    3. 3)
    4. 4)
    5. 5)
    6. 6)
      • Wicker, S.: Error control systems for digital communication and storage, 1995 (Prentice-Hall)
    7. 7)
    8. 8)
      • Dubney, G., Reed, I.S.: `Decoding the (23, 12, 7) Golay code using bit-error probability estimates', Proc. IEEE Conf. Globecom’05, December 2005, St. Louis, Missouri, 3, p. 1325–1330
    9. 9)
      • Reed, I.S.: `Statistical error control of a realizable binary symmetric channel', Group Report 47.35, 1959, Massachusetts Institute of Technology, Lincoln Laboratory, Massachusetts
    10. 10)
    11. 11)
      • Berlekamp, E.R.:: Algebraic coding theory, 1984 (Aegean Park Press)
    12. 12)
      • Prange, E.: `Some cyclic error-correcting codes with simple decoding algorithms', Air Force Cambridge Research Center-TN-58–156 Report, 1958
    13. 13)
    14. 14)
    15. 15)
This is a required field
Please enter a valid email address