Low-Density Parity Check Codes over GF (q)

被引：769

作者：

Davey, Matthew C. ^{[1
]}

MacKay, David ^{[1
]}

机构：

[1] Univ Cambridge, Cavendish Lab, Cambridge CB3 0HE, England

来源：

IEEE COMMUNICATIONS LETTERS | 1998年 / 2卷 / 06期

关键词：

Binary symmetric channel; channel coding; error correction coding; Gaussian channel; iterative probabilistic decoding;

D O I：

10.1109/4234.681360

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 ;

摘要：

Gallager's low-density binary parity check codes have been shown to have near-Shannon limit performance when decoded using a probabilistic decoding algorithm. We report the empirical results of error-correction using the analogous codes over GF (q) for q > 2; with binary symmetric channels and binary Gaussian channels. We find a significant improvement over the performance of the binary codes, including a rate 1/4 code with bit error probability < 10(-5) at E(b)/N(0) = 0.2 dB.

引用

页码：165 / 167

页数：3

共 7 条

[1]

[Anonymous], 1963, RES MONOGRAPH SERIES

[2]

DAVEY MC, 1998, P INT WORKS IN PRESS

[3] LOW-DENSITY PARITY-CHECK CODES [J].

GALLAGER, RG .

IRE TRANSACTIONS ON INFORMATION THEORY, 1962, 8 (01) :21-&

[4] Near Shannon limit performance of low density parity check codes [J].

MacKay, DJC ;

Neal, RM .

ELECTRONICS LETTERS, 1996, 32 (18) :1645-1646

[5]

MacKay DJC, 1995, LECT NOTES COMPUT SC, V1025, P100

[6]

MACKAY DJC, 1997, IEEE T INFORM UNPUB

[7]

Pearl J., 1988, PROBABILISTIC REASON, DOI [DOI 10.1016/C2009-0-27609-4, 10.1016/c2009-0-27609-4]

← 1 →