Trellis-based decoding of binary linear block codes
From MaRDI portal
Recommendations
Cited in
(22)- Two decyclical lengthening methods for block codes
- The BCJR trellis and trellis decoders for some BCH codes
- Iterative maximum-likelihood trellis decoding for block codes
- MAP algorithms for decoding linear block codes based on sectionalized trellis diagrams
- scientific article; zbMATH DE number 3859037 (Why is no real title available?)
- Efficient maximum likelihood decoding of linear block codes using a trellis
- scientific article; zbMATH DE number 1284437 (Why is no real title available?)
- A trellis coded modulation scheme constructed from block coded modulation with interblock memory
- scientific article; zbMATH DE number 1106311 (Why is no real title available?)
- Complementary reliability-based decodings of binary linear block codes
- On hybrid stack decoding algorithms for block codes
- A sequential decoder for linear block codes with a variable bias-term metric
- scientific article; zbMATH DE number 1181550 (Why is no real title available?)
- A trellis-based recursive maximum-likelihood decoding algorithm for binary linear block codes
- Twin-stack decoding of recursive systematic convolutional codes
- A simple one-sweep algorithm for optimal APP symbol decoding of linear block codes
- A low-weight trellis-based iterative soft-decision decoding algorithm for binary linear block codes
- A forward-only recursion algorithm for MAP decoding of linear block codes
- Soft trellis-based decoder for linear block codes
- Erasure-free sequential decoding of trellis codes
- Sequential decoding with trellis shaping
- On the BCJR trellis for linear block codes
This page was built for publication: Trellis-based decoding of binary linear block codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4382327)