Efficient maximum likelihood decoding of linear block codes using a trellis
DOI10.1109/TIT.1978.1055821zbMATH Open0371.94027MaRDI QIDQ4149649FDOQ4149649
Authors: Jack Keil Wolf 
Publication date: 1978
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Recommendations
Viterbi algorithmcyclic codesproduct codeslinear block codestrellisbinary single parity check codesoft decision maximum likelihood decoding
Linear codes (general theory) (94B05) Cyclic codes (94B15) Decoding (94B35) Combined modulation schemes (including trellis codes) in coding theory (94B12)
Cited In (20)
- A note on characteristic generators of a free cyclic code and its dual
- Error-trellises for convolutional codes. II: Decoding methods
- MAP algorithms for decoding linear block codes based on sectionalized trellis diagrams
- An efficient maximum-likelihood-decoding algorithm for linear block codes with algebraic decoder
- On viewing block codes as finite automata.
- Maximum likelihood soft decoding of binary block codes and decoders for the Golay codes
- Sequential decoding for a subcode of Reed Solomon codes
- New approaches to reduced-complexity decoding
- Soft decoding of short/medium length codes using ordered statistics for quantum key distribution
- Maximum-likelihood list decoding using trellises
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the relative profiles of a linear code and a subcode
- On self-dual ternary codes and their coordinate ordering.
- Code constructions and existence bounds for relative generalized Hamming weight
- Soft trellis-based decoder for linear block codes
- Maximum-likelihood soft decision decoding of BCH codes
- A Recursive Hadamard Transform Optimal Soft Decision Decoding Algorithm
- On trellis structures for Reed-Muller codes
- The weight hierarchies and generalized weight spectra of the projective codes from degenerate quadrics
This page was built for publication: Efficient maximum likelihood decoding of linear block codes using a trellis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4149649)
