Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes
From MaRDI portal
Publication:4544716
Recommendations
- Asymptotic bounds on the decoding error probability for two ensembles of LDPC codes
- Upper bounds on the rate of LDPC codes
- Parity-Check Density Versus Performance of Binary Linear Block Codes: New Bounds and Applications
- The capacity of low-density parity-check codes under message-passing decoding
- Parity-check density versus performance of binary linear block codes over memoryless symmetric channels
Cited in
(15)- Asymptotic bounds on the decoding error probability for two ensembles of LDPC codes
- Average and reliability error exponents in low-density parity-check codes
- Upper bounds on the rate of LDPC codes
- The capacity of low-density parity-check codes under message-passing decoding
- scientific article; zbMATH DE number 5811177 (Why is no real title available?)
- Performance Analysis of Linear Codes under Maximum-Likelihood Decoding: A Tutorial
- scientific article; zbMATH DE number 6694244 (Why is no real title available?)
- Lower bounds on achievable rates for limited bitshift correcting codes
- A joint decoding algorithm of LDPC codes
- Finite-Dimensional Bounds on ${\BBZ}_m$ and Binary LDPC Codes With Belief Propagation Decoders
- Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes
- Iterative decoding of LDPC codes: some bounds and properties
- Distance properties of short LDPC codes and their impact on the BP, ML and near-ML decoding performance
- On the error-correcting capability of LDPC codes
- The Generalized Stochastic Likelihood Decoder: Random Coding and Expurgated Bounds
This page was built for publication: Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544716)