Title :
Upper bounds on the rate of LDPC codes as a function of minimum distance
Author :
Ben-Haim, Yael ; Litsyn, Simon
Author_Institution :
Sch. of Electr. Eng., Tel Aviv Univ.
Abstract :
New upper bounds on the rate of low-density parity-check (LDPC) codes as a function of the minimum distance of the code are derived. These bounds are based on combinatorial arguments and linear programming. They improve on the previous bounds due to Burshtein et al. It is proved that at least for high rate LDPC codes have worse relative minimum distance than the one guaranteed by the Gilbert-Varshamov bound
Keywords :
linear programming; parity check codes; Gilbert-Varshamov bound; LDPC codes; combinatorial arguments; linear programming; low-density parity-check codes; minimum distance; upper bounds; Block codes; Entropy; H infinity control; Iterative decoding; Linear code; Linear programming; Parity check codes; Random variables; Sparse matrices; Upper bound;
Conference_Titel :
Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on
Conference_Location :
Adelaide, SA
Print_ISBN :
0-7803-9151-9
DOI :
10.1109/ISIT.2005.1523290
