Graph-based iterative decoding algorithms for parity-concatenated trellis codes
From MaRDI portal
Recommendations
- Iterative decoding of concatenated codes: a tutorial
- Iterative decoding of binary block and convolutional codes
- High-performance iterative Viterbi algorithm for conventional serial concatenated codes
- Algebraic coding for iterative decoding
- Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding
Cited in
(11)- Bit-optimal decoding of codes whose Tanner graphs are trees
- Protograph-based decoding of low-density parity-check codes with Hamming weight amplifiers
- Performance limits of compound codes with symbol-based iterative decoding
- scientific article; zbMATH DE number 1714655 (Why is no real title available?)
- scientific article; zbMATH DE number 1714658 (Why is no real title available?)
- Algebraic coding for iterative decoding
- Adaptive Soft-Decision Iterative Decoding Using Edge Local Complementation
- Two-dimensional iterative processing for DAB receivers based on trellis-decomposition
- High-performance iterative Viterbi algorithm for conventional serial concatenated codes
- scientific article; zbMATH DE number 750223 (Why is no real title available?)
- Graph-Based Decoding in the Presence of ISI
This page was built for publication: Graph-based iterative decoding algorithms for parity-concatenated trellis codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544542)