Efficient maximum likelihood decoding of linear block codes using a trellis

DOI10.1109/TIT.1978.1055821zbMath0371.94027MaRDI QIDQ4149649

Jack Keil Wolf

Publication date: 1978

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

zbMATH Keywords

linear block codescyclic codesViterbi algorithmtrellisproduct codesbinary single parity check codesoft decision maximum likelihood decoding

Mathematics Subject Classification ID

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

Related Items (11)

Soft decoding of short/medium length codes using ordered statistics for quantum key distribution ⋮ Code constructions and existence bounds for relative generalized Hamming weight ⋮ The weight hierarchies and generalized weight spectra of the projective codes from degenerate quadrics ⋮ On viewing block codes as finite automata. ⋮ Sequential decoding for a subcode of Reed Solomon Codes ⋮ A Recursive Hadamard Transform Optimal Soft Decision Decoding Algorithm ⋮ On trellis structures for Reed-Muller codes ⋮ New approaches to reduced-complexity decoding ⋮ On the relative profiles of a linear code and a subcode ⋮ A note on characteristic generators of a free cyclic code and its dual ⋮ On self-dual ternary codes and their coordinate ordering.

This page was built for publication: Efficient maximum likelihood decoding of linear block codes using a trellis