Sufficient Conditions on Most Likely Local Sub-codewords in Recursive Maximum Likelihood Decoding Algorithms

Authors:
Tadao Kasami;Hitoshi Tokushige;Yuichi Kaji
Affiliations:
-;-;-
Venue:
AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Year:
2001

Citing 3
Cited 0

Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes

Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes
On Integer Programming Problems Related to Soft-Decision Iterative Decoding Algorithms

AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
A trellis-based recursive maximum-likelihood decoding algorithm for binary linear block codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

First, top-down RMLD (recursive maximum likelihood decoding) algorithms are reviewed. Then, in connection with adjacent sub-codewords, a concept of conditional syndrome is introduced. Based on this, sufficient conditions of most likely local sub-codewords in top-down RMLD algorithms are presented. These conditions lead to efficient implementations of top-down RMLD algorithms.