On Decoding of Low-Density Parity-Check Codes Over the Binary Erasure Channel
From MaRDI portal
Publication:3547495
DOI10.1109/TIT.2004.824918zbMATH Open1288.94114OpenAlexW2104345270MaRDI QIDQ3547495FDOQ3547495
Authors: Hossein Pishro-Nik, Faramarz Fekri 
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2004.824918
Recommendations
- Results on the Improved Decoding Algorithm for Low-Density Parity-Check Codes Over the Binary Erasure Channel
- Finite-length analysis of low-density parity-check codes on the binary erasure channel
- Iterative decoding of LDPC codes: some bounds and properties
- Performance of low-density parity-check codes with linear minimum distance
- Bounds on the performance of belief propagation decoding
Cited In (36)
- A Finite-Length Algorithm for LDPC Codes Without Repeated Edges on the Binary Erasure Channel
- Joint message-passing decoding of LDPC codes and partial-response channels
- Decoding of low-density codes with parity-check matrices composed of permutation matrices in an erasure channel
- Codes on sparse graphs for satellite and space communications
- Iterative decoding of one-step majority logic decodable codes based on belief propagation
- Low-density parity-check codes over gaussian channels with erasures
- Generalized Low-Density Parity-Check coding scheme with Partial-Band Jamming
- A uniformly reweighted iterative decoding algorithm in BICM-ID system
- A low rate coding and decoding scheme based on the LDPC-BCH graph
- The capacity of low-density parity-check codes under message-passing decoding
- Improved BP-based decoding algorithms integrated with GA for LDPC codes
- Efficient decoding implementations of LDPC codes
- Analysis of the relation between properties of LDPC codes and the Tanner graph
- Bilayer Low-Density Parity-Check Codes for Decode-and-Forward in Relay Channels
- Low-power LDPC decoding by exploiting the fault-tolerance of the sum-product algorithm
- Min-zone selection decoding algorithm for LDPC codes
- Decoding algorithm of low-density parity-check codes based on Bowman-Levin approximation
- Finite-length analysis of low-density parity-check codes on the binary erasure channel
- A joint decoding algorithm of LDPC codes
- The density evolution for layered decoding algorithms of low-density parity-check codes
- Peeling decoding of LDPC codes with applications in compressed sensing
- A decoding algorithm for 2D convolutional codes over the erasure channel
- Threshold Saturation for Nonbinary SC-LDPC Codes on the Binary Erasure Channel
- Exploiting coding theory for classification: an LDPC-based strategy for multiclass-to-binary decomposition
- Improved Bit-Flipping Decoding of Low-Density Parity-Check Codes
- Mean field and mixed mean field iterative decoding of low-density parity-check codes
- Results on Punctured Low-Density Parity-Check Codes and Improved Iterative Decoding Techniques
- Iterative decoding of LDPC codes: some bounds and properties
- Results on the Improved Decoding Algorithm for Low-Density Parity-Check Codes Over the Binary Erasure Channel
- Forced-convergence decoding for {LDPC}-coded modulation
- On Parity-Check Collections for Iterative Erasure Decoding That Correct all Correctable Erasure Patterns of a Given Size
- Title not available (Why is that?)
- Distance properties of short LDPC codes and their impact on the BP, ML and near-ML decoding performance
- Composite scheme LR+Th for decoding with erasures and its effective equivalence to Forney's rule
- Effect of one redundant parity-check equation on the stopping distance
- Erasure correction by low-density codes
This page was built for publication: On Decoding of Low-Density Parity-Check Codes Over the Binary Erasure Channel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547495)
