Upper bounds on the rate of LDPC codes as a function of minimum distance

Yael Ben-Haim, Simon Litsyn. Upper bounds on the rate of LDPC codes as a function of minimum distance. In Proceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 2005, Adelaide, South Australia, Australia, 4-9 September 2005. pages 47-51, IEEE, 2005. [doi]

@inproceedings{Ben-HaimL05-0,
  title = {Upper bounds on the rate of LDPC codes as a function of minimum distance},
  author = {Yael Ben-Haim and Simon Litsyn},
  year = {2005},
  doi = {10.1109/ISIT.2005.1523290},
  url = {https://doi.org/10.1109/ISIT.2005.1523290},
  researchr = {https://researchr.org/publication/Ben-HaimL05-0},
  cites = {0},
  citedby = {0},
  pages = {47-51},
  booktitle = {Proceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 2005, Adelaide, South Australia, Australia, 4-9 September 2005},
  publisher = {IEEE},
  isbn = {0-7803-9151-9},
}