An evaluation method of the error performance of linear codes using coset partition

摘要

To evaluate the error performance of an error correcting code is significant for realizing a reliable communication system. However, to compute the error probability of a maximum-likelihood decoder (MLD) is especially difficult task for long practical codes. Though an efficient algorithm for the MLD, named an adaptive MLD algorithm, has been proposed by the authors, it cannot be applied to very large block codes. In this study, a new method to evaluate the error performance of linear block codes is proposed. In the proposed method, a code C to be evaluated is divided into cosets of a subcode of C, and MLD algorithms for the cosets constitute the whole evaluation system. In the proposed approach, the total evaluation time depends on how many and in a what way the cosets are chosen. The error performance of some Reed-Muller codes with length 128 is evaluated for running study.