作者: J. Snyders , Y. Be'ery
DOI: 10.1109/18.42214
关键词:
摘要: Maximum-likelihood soft-decision decoding of linear block codes is addressed. A binary multiple-check generalization the Wagner rule presented, and two methods for its implementation, one which resembles suboptimal Forney-Chase algorithms, are described. Besides efficient soft small codes, generalized enables utilization subspaces a wide variety, thereby yielding maximum-likelihood decoders with substantially reduced computational complexity some larger codes. More sophisticated choice exploitation structure both subspace coset representatives demonstrated (24, 12) Golay code, gain factor about 2 respect to previous methods. ternary single-check version applied (12, 6) code. >