Computationally Optimal Metric-First Code Tree Search Algorithms

DOI10.1109/TCOM.1984.1096122MaRDI QIDQ3330521zbMATH OpenFDO

Authors Seshadri Mohan, John B. Anderson

Publication date 1984

Published in IEEE Transactions on Communications (Search for Journal in Brave)

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

zbMATH Keywords

channel decodingCode tree search algorithmsmaximum likelihood sequence estimationmetric-first algorithmspattern recognitionsearchingsource encoding,

Mathematics Subject Classification ID

Searching and sorting (68P10) Pattern recognition, speech recognition (68T10) Source coding (94A29) Decoding (94B35)

Recommendations

• Optimal Computer Search Trees and Variable-Length Alphabetical Codes
• Bounding the depth of search trees
• Sequential decoding based on an error criterion
• Variable-length codes and the Fano metric
• A stack algorithm for source coding with a fidelity criterion

Cited in

(1)

• Implementation aspects of list sphere decoder algorithms for MIMO-OFDM systems

This page was built for publication: Computationally Optimal Metric-First Code Tree Search Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3330521)