作者: A. Bennatan , D. Burshtein
关键词: Discrete mathematics 、 Concatenated error correction code 、 Mathematics 、 McEliece cryptosystem 、 Low-density parity-check code 、 Serial concatenated convolutional codes 、 Decoding methods 、 Block code 、 Forward error correction 、 Turbo code
摘要: We discuss three structures of modified low-density parity-check (LDPC) code ensembles designed for transmission over arbitrary discrete memoryless channels. The first structure is based on the well-known binary LDPC codes following constructions proposed by Gallager and McEliece, second (q-ary) alphabets employing modulo-q addition, as presented Gallager, third defined field GF(q). All are obtained applying a quantization mapping coset ensemble. present tools analysis nonbinary show that all configurations, under maximum-likelihood (ML) decoding, capable reliable communication at rates arbitrarily close to capacity any channel. practical iterative decoding our simulation results additive white Gaussian noise (AWGN) channel confirming effectiveness codes.