An improvement of soft-decision maximum-likelihood decoding algorithm using hard-decision bounded-distance decoding

DOI10.1109/18.605601MaRDI QIDQ4345637zbMATH OpenOpenAlexFDO

Authors Toshimitsu Kaneko, Toshihisa Nishijima, Shigeichi Hirasawa

Publication date 23 July 1997

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

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

zbMATH Keywords

block codesdecoding time complexityhard-decision bounded-distance decodingsoft-decision maximum-likelihood decoding algorithmspace complexity

Mathematics Subject Classification ID

Decoding (94B35)

Recommendations

• Hard- and soft-decision decoding beyond the half minimum distance---An algorithm for linear codes (Corresp.)
• Bounded distance+1 soft-decision Reed-Solomon decoding
• Maximum-likelihood soft decision decoding of BCH codes
• On maximum likelihood soft-decision decoding of binary linear codes
• A novel approach to soft decision decoding of threshold decodable codes (Corresp.)
• Soft decision maximum likelihood decoding of partial-unit-memory codes
• scientific article; zbMATH DE number 493101
• Design of an Efficient Maximum Likelihood Soft Decoder for Systematic Short Block Codes
• A new treatment of priority-first search maximum-likelihood soft-decision decoding of linear block codes
• Improved Iterative Hard- and Soft-Reliability Based Majority-Logic Decoding Algorithms for Non-Binary Low-Density Parity-Check Codes

Cited in

(3)

• scientific article; zbMATH DE number 2127883 (Why is no real title available?)
• scientific article; zbMATH DE number 6908238 (Why is no real title available?)
• scientific article; zbMATH DE number 2154516 (Why is no real title available?)

This page was built for publication: An improvement of soft-decision maximum-likelihood decoding algorithm using hard-decision bounded-distance decoding

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