conference paper · IEEE International Symposium on Information Theory (ISIT) · 2005
Upper bounds on the rate of LDPC codes as a function of minimum distance
Yael Ben‐Haim, Simon N. Litsyn
Cited by 3Abstract and details only
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
Cite this paper
Ben‐Haim, Y., & Litsyn, S. N. (2005). Upper bounds on the rate of LDPC codes as a function of minimum distance. IEEE International Symposium on Information Theory (ISIT), 47–51. https://doi.org/10.1109/isit.2005.1523290
Ben‐Haim, Yael, and Simon N. Litsyn. “Upper bounds on the rate of LDPC codes as a function of minimum distance.” IEEE International Symposium on Information Theory (ISIT), 2005, pp. 47–51, https://doi.org/10.1109/isit.2005.1523290.
Ben‐Haim, Yael, and Simon N. Litsyn. 2005. “Upper bounds on the rate of LDPC codes as a function of minimum distance.” IEEE International Symposium on Information Theory (ISIT): 47–51. https://doi.org/10.1109/isit.2005.1523290.
Ben‐Haim, Y. and Litsyn, S.N. (2005) ‘Upper bounds on the rate of LDPC codes as a function of minimum distance’, IEEE International Symposium on Information Theory (ISIT), pp. 47–51. Available at: https://doi.org/10.1109/isit.2005.1523290.
@article{benhaim2005upper,
title = {{Upper bounds on the rate of LDPC codes as a function of minimum distance}},
author = {Ben‐Haim, Yael and Litsyn, Simon N.},
journal = {IEEE International Symposium on Information Theory (ISIT)},
pages = {47--51},
year = {2005},
doi = {10.1109/isit.2005.1523290}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.