Efficient maximum likelihood decoding of linear block codes using a trellis

DOI10.1109/TIT.1978.1055821MaRDI QIDQ4149649zbMATH OpenFDO

Authors Jack Keil Wolf

Publication date 1978

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

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

zbMATH Keywords

binary single parity check codecyclic codeslinear block codesproduct codessoft decision maximum likelihood decodingtrellisViterbi algorithm

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3859037
• scientific article; zbMATH DE number 1135091
• Soft trellis-based decoder for linear block codes
• A trellis-based recursive maximum-likelihood decoding algorithm for binary linear block codes
• Maximum-likelihood list decoding using trellises

Cited in

(25)

• New approaches to reduced-complexity decoding
• Maximum-likelihood list decoding using trellises
• The weight hierarchies and generalized weight spectra of the projective codes from degenerate quadrics
• On viewing block codes as finite automata.
• On self-dual ternary codes and their coordinate ordering.
• On trellis structures for Reed-Muller codes
• On the relative profiles of a linear code and a subcode
• Error-trellises for convolutional codes. II: Decoding methods
• MAP algorithms for decoding linear block codes based on sectionalized trellis diagrams
• A note on characteristic generators of a free cyclic code and its dual
• scientific article; zbMATH DE number 3859037 (Why is no real title available?)
• Code constructions and existence bounds for relative generalized Hamming weight
• A Recursive Hadamard Transform Optimal Soft Decision Decoding Algorithm
• An efficient maximum-likelihood-decoding algorithm for linear block codes with algebraic decoder
• Maximum-likelihood soft decision decoding of BCH codes
• Simplified Viterbi decoding of geometrically uniform TCM codes
• scientific article; zbMATH DE number 1106311 (Why is no real title available?)
• scientific article; zbMATH DE number 1135091 (Why is no real title available?)
• scientific article; zbMATH DE number 1181550 (Why is no real title available?)
• A trellis-based recursive maximum-likelihood decoding algorithm for binary linear block codes
• Sequential decoding for a subcode of Reed Solomon codes
• Maximum likelihood soft decoding of binary block codes and decoders for the Golay codes
• Soft trellis-based decoder for linear block codes
• Soft decoding of short/medium length codes using ordered statistics for quantum key distribution
• Minimal trellises for non-degenerate and degenerate decoding of quantum stabilizer codes

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)