An analysis of the block error probability performance of iterative decoding
DOI10.1109/TIT.2005.856942zbMATH Open1303.94144OpenAlexW2156437081MaRDI QIDQ3547232FDOQ3547232
Authors: M. Lentmaier, Dmitri V. Truhachev, Kamil S. Zigangirov, Daniel J. jun. Costello 
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.2005.856942
Recommendations
- Iterative decoding of LDPC codes: some bounds and properties
- A method for convergence analysis of iterative probabilistic decoding
- Mathematical analysis of an iterative decoding algorithm for low-density codes
- Iterative decoding of binary block and convolutional codes
- On the theory of low-density convolutional codes. II
convergence analysisbelief propagationiterative decodingdensity evolutionturbo codeslow-density parity-check (LDPC) codesblock error probability
Cited In (11)
- A method for convergence analysis of iterative probabilistic decoding
- Performance analysis of the error-forecasting decoding for interleaved block codes on Gilbert-Elliott channels
- Analysis of the iterative decoding of ldpc and product codes using the gaussian approximation
- Decoding of low-density codes with parity-check matrices composed of permutation matrices in an erasure channel
- Iterative decoding of codes over complex numbers for impulsive noise channels
- Title not available (Why is that?)
- Mathematical analysis of an iterative decoding algorithm for low-density codes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Turbo Codes in Binary Erasure Channel
- On the error-correcting capability of LDPC codes
This page was built for publication: An analysis of the block error probability performance of iterative decoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547232)
