Upper bounds on the rate of LDPC codes
Tóm tắt
We derive upper bounds on the rate of low-density parity-check (LDPC) codes for which reliable communication is achievable. We first generalize Gallager's (1963) bound to a general binary-input symmetric-output channel. We then proceed to derive tighter bounds. We also derive upper bounds on the rate as a function of the minimum distance of the code. We consider both individual codes and ensembles of codes.
Từ khóa
#Codes #Channel codingTài liệu tham khảo
10.1016/0012-365X(77)90117-0
10.1109/ISIT.2001.935912
10.1109/18.910575
10.1109/18.748992
maurey, 1979, construction de suites symétriques, Compt Rend Acad Sci Paris, 288, 679
milman, 1986, asymptotic theory of finite dimensional normed spaces, Lecture Notes in Mathematics, 1200
10.1109/TIT.1977.1055688
10.1109/18.959254
10.1109/18.910577
10.1109/18.910578
10.1109/18.910588
10.1109/ICC.1993.397441
10.1017/S0963548300001796
10.1109/18.971742
10.1007/BF01864160
cover, 1991, Elements of Information Theory, 10.1002/0471200611
balinski, 1969, methods for integer programming: algebraic, combinatorial and enumerative, Progress in Operations Research Vol III Relationship Between Operations Research and the Computer, 195
10.1016/0095-8956(72)90002-0
gallager, 1963, Low Density Parity-Check Codes, 10.7551/mitpress/4347.001.0001
10.1109/18.556667
10.1090/S0002-9904-1969-12393-1
10.1109/18.910591
vizing, 1964, on an estimate of the chromatic class of a <formula> <tex>$p$</tex></formula>-graph, Diskretnyi Analiz, 3, 25