An accurate density evolution analysis for a finite-state Markov channel
From MaRDI portal
Publication:3062055
DOI10.1080/09720529.2010.10698278zbMath1206.94020OpenAlexW2042299055MaRDI QIDQ3062055
Naoto Kobayashi, Shigeichi Hirasawa, Toshiyasu Matsushima
Publication date: 3 January 2011
Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09720529.2010.10698278
Cites Work
- Capacity and coding for the gilbert-elliott channels
- Analysis of Low-Density Parity-Check Codes for the Gilbert–Elliott Channel
- On Designing Good LDPC Codes for Markov Channels
- Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
- The capacity of low-density parity-check codes under message-passing decoding
- Design of capacity-approaching irregular low-density parity-check codes
- Capacity, mutual information, and coding for finite-state Markov channels
This page was built for publication: An accurate density evolution analysis for a finite-state Markov channel