Upper bounds on the rate of LDPC codes
From MaRDI portal
Publication:4677565
DOI10.1109/TIT.2002.801408zbMATH Open1062.94070OpenAlexW2159887350MaRDI QIDQ4677565FDOQ4677565
Authors: David Burshtein, Michael Krivelevich, Gadi Miller, Simon Litsyn 
Publication date: 11 May 2005
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2002.801408
Recommendations
- Upper bounds on the rate of LDPC codes as a function of minimum distance
- The rate of regular ldpc codes
- Upper Bounds on the Rate of LDPC Codes for a Class of Finite-State Markov Channels
- Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes
- A new upper bound on the rate of non-binary codes
- On the error-correcting capability of LDPC codes
- scientific article; zbMATH DE number 3410920
- LP/SDP Hierarchy Lower Bounds for Decoding Random LDPC Codes
- LP/SDP hierarchy lower bounds for decoding random LDPC codes
- Bounds on Maximum Likelihood Decoding Performance for Linear Codes at Low Rates
Cited In (13)
- A fast BER evaluation method for LDGM codes
- Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes
- A new upper bound on the rate of non-binary codes
- Lower bounds on achievable rates for limited bitshift correcting codes
- Upper bounds on the rate of LDPC codes as a function of minimum distance
- Performance of low-density parity-check codes with linear minimum distance
- Finite-Dimensional Bounds on ${\BBZ}_m$ and Binary LDPC Codes With Belief Propagation Decoders
- The rate of regular ldpc codes
- On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications
- Upper Bounds on the Rate of LDPC Codes for a Class of Finite-State Markov Channels
- Parity-Check Density Versus Performance of Binary Linear Block Codes: New Bounds and Applications
- On the error-correcting capability of LDPC codes
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4677565)
