On the complexity of suboptimal decoding for list and decision feedback schemes
From MaRDI portal
Publication:2489924
DOI10.1016/j.dam.2005.03.023zbMath1089.94043DBLPjournals/dam/FreudenbergerZ06OpenAlexW2055651006WikidataQ59329670 ScholiaQ59329670MaRDI QIDQ2489924
Victor Zyablov, Jürgen Freudenberger
Publication date: 28 April 2006
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2005.03.023
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two decoding algorithms for linear codes
- Complexity of decoding for linear codes
- Maximum-likelihood list decoding using trellises
- Bounds on complexity of trellis decoding of linear block codes
- List and soft symbol output Viterbi algorithms: extensions and comparisons
- Suboptimal decoding of linear codes: partition technique
- The complexity of information set decoding
- Composite scheme LR+Th for decoding with erasures and its effective equivalence to Forney's rule
- On the complexity of minimum distance decoding of long linear codes
- Lower bounds on trellis complexity of block codes
- A simple derivation of the coding theorem and some applications
- Exponential error bounds for erasure, list, and decision feedback schemes
This page was built for publication: On the complexity of suboptimal decoding for list and decision feedback schemes
