A trellis-based recursive maximum-likelihood decoding algorithm for binary linear block codes

DOI10.1109/18.661515zbMath0912.94020OpenAlexW2120033635MaRDI QIDQ4400284

Toru Fujiwara, Yamamoto Kasami, Hiroshi Yamamoto, Shu Lin

Publication date: 2 August 1998

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.661515

zbMATH Keywords

linear block codemaximum-likelihood decodingtrellis diagram

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combined modulation schemes (including trellis codes) in coding theory (94B12) Decoding (94B35)

Related Items (2)

Design and decoding of polar codes with large kernels: a survey ⋮ On Viterbi-like algorithms and their application to Reed-Muller codes

This page was built for publication: A trellis-based recursive maximum-likelihood decoding algorithm for binary linear block codes