Bounds on the performance of belief propagation decoding
From MaRDI portal
Publication:4544767
DOI10.1109/18.971742zbMATH Open1059.94534OpenAlexW2159337637MaRDI QIDQ4544767FDOQ4544767
Authors: David Burshtein, Gadi Miller 
Publication date: 4 August 2002
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/58b60ede4c3992353aef8651289e81c051e9cba8
Recommendations
- The capacity of low-density parity-check codes under message-passing decoding
- Improved low-density parity-check codes using irregular graphs
- Iterative decoding of LDPC codes: some bounds and properties
- Properties of Optimum Binary Message-Passing Decoders
- Finite-Dimensional Bounds on ${\BBZ}_m$ and Binary LDPC Codes With Belief Propagation Decoders
Cited In (18)
- Joint message-passing decoding of LDPC codes and partial-response channels
- Typical performance of regular low-density parity-check codes over general symmetric channels
- Spatially Coupled Ensembles Universally Achieve Capacity Under Belief Propagation
- Parallel versus sequential updating for belief propagation decoding
- Iterative decoding of one-step majority logic decodable codes based on belief propagation
- On Decoding of Low-Density Parity-Check Codes Over the Binary Erasure Channel
- Belief propagation decoding of quantum channels by passing quantum messages
- Design of capacity-approaching irregular low-density parity-check codes
- Low-complexity cryptographic hash functions
- Properties of Optimum Binary Message-Passing Decoders
- Binary intersymbol interference channels: gallager codes, density evolution, and code performance bounds
- Mean field and mixed mean field iterative decoding of low-density parity-check codes
- Finite-Dimensional Bounds on ${\BBZ}_m$ and Binary LDPC Codes With Belief Propagation Decoders
- Iterative decoding of LDPC codes: some bounds and properties
- Serial Schedules for Belief-Propagation: Analysis of Convergence Time
- Performance of low density parity check codes as a function of actual and assumed noise levels
- Maxwell Construction: The Hidden Bridge Between Iterative and Maximuma PosterioriDecoding
- Constrained Information Combining: Theory and Applications for LDPC Coded Systems
This page was built for publication: Bounds on the performance of belief propagation decoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544767)
