A new treatment of priority-first search maximum-likelihood soft-decision decoding of linear block codes

DOI10.1109/18.737538zbMATH Open0932.94036OpenAlexW2095749754MaRDI QIDQ4701233FDOQ4701233

Authors: Yunghsiang Sam Han 

Publication date: 21 November 1999

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

Full work available at URL: https://semanticscholar.org/paper/8c697e8d5b4fd2e118599f692a0500fe28c9720a

Recommendations

• Efficient priority-first search maximum-likelihood soft-decision decoding of linear block codes
• Decoding linear block codes using a priority-first search: performance analysis and suboptimal version
• On maximum likelihood soft-decision decoding of binary linear codes

zbMATH Keywords

Dijkstra's algorithmsoft-decision decodingpriority-first search

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Linear codes (general theory) (94B05) Decoding (94B35)

Cited In (7)

• Title not available (Why is that?)
• Computationally efficient soft-decision decoding of linear block codes based on ordered statistics
• A novel approach to soft decision decoding of threshold decodable codes (Corresp.)
• Soft-Decision Decoding of Linear Block Codes Using Preprocessing and Diversification
• Graph Configurations and Decoding Performance
• On maximum likelihood soft-decision decoding of binary linear codes
• An improvement of soft-decision maximum-likelihood decoding algorithm using hard-decision bounded-distance decoding

This page was built for publication: A new treatment of priority-first search maximum-likelihood soft-decision decoding of linear block codes

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