On the complexity of suboptimal decoding for list and decision feedback schemes
From MaRDI portal
Publication:2489924
Recommendations
Cites work
- scientific article; zbMATH DE number 3760081 (Why is no real title available?)
- scientific article; zbMATH DE number 3485627 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- A simple derivation of the coding theorem and some applications
- Bounds on complexity of trellis decoding of linear block codes
- Complexity of decoding for linear codes
- Composite scheme LR+Th for decoding with erasures and its effective equivalence to Forney's rule
- Exponential error bounds for erasure, list, and decision feedback schemes
- List and soft symbol output Viterbi algorithms: Extensions and comparisons
- Lower bounds on trellis complexity of block codes
- Maximum-likelihood list decoding using trellises
- On the complexity of minimum distance decoding of long linear codes
- Suboptimal decoding of linear codes: partition technique
- The complexity of information set decoding
- Two decoding algorithms for linear codes
Cited in
(2)
This page was built for publication: On the complexity of suboptimal decoding for list and decision feedback schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489924)