Minimum-Distance Decoding of Linear Block Codes with Soft-Decision

연판정에 의한 선형 블록 부호의 최소 거리 복호법

We have proposed a soft-decision decoding method for block codes. With careful examinations of the first hard-decision decoded results, The candidate codewords are efficiently searched for. Thus, we can reduce the decoding complexity (the number of hard-decision decodings) and lower the block error probability. Computer simulation results are presented for the (23,12) Golay code. They show that the decoding complexity is considerably reduced and the block error probability is close to that of the maximum likelihood decoder.