Upper bounds on the rate of LDPC codes as a function of minimum distance
From MaRDI portal
Publication:3546556
DOI10.1109/TIT.2006.872972zbMath1285.94131MaRDI QIDQ3546556
Yael Ben-Haim, Simon N. Litsyn
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items (2)
Bounds on the minimum code distance for nonbinary codes based on bipartite graphs ⋮ Upper bound on the minimum distance of LDPC codes over \(\mathrm{GF}(q)\) based on counting the number of syndromes
This page was built for publication: Upper bounds on the rate of LDPC codes as a function of minimum distance
