On Viterbi-like algorithms and their application to Reed-Muller codes
From MaRDI portal
Publication:1827580
DOI10.1016/j.jco.2004.01.003zbMath1049.94026OpenAlexW1980154844MaRDI QIDQ1827580
Publication date: 6 August 2004
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2004.01.003
Cites Work
- Codes on graphs: constraint complexity of cycle-free realizations of linear codes
- Coset codes. II. Binary lattices and related codes
- Maximum-likelihood soft decision decoding of BCH codes
- Quasi-cyclic structure of Reed-Muller codes and their smallest regular trellis diagram
- A trellis-based recursive maximum-likelihood decoding algorithm for binary linear block codes
- On the trellis structure of block codes
- On the BCJR trellis for linear block codes
- Optimal sectionalization of a trellis
This page was built for publication: On Viterbi-like algorithms and their application to Reed-Muller codes