Acyclic Tanner graphs and maximum-likelihood decoding of linear block codes

摘要

The maximum-likelihood decoding of linear block codes by Wagner rule decoding is discussed. In this approach, the Wagner rule decoding, which has been primarily applied to single parity check codes, is employed on acyclic Tanner graphs. Accordingly, a coset decoding equipped with Wagner rule decoding is applied to the decoding of a code C having a Tanner graph with cycles. A subcode C_1 of C with acyclic Tanner graph is chosen as the base subcode.