An Optimality Testing Algorithm for a Decoded Codeword of Binary Block Codes and Its Computational Complexity

Authors:
Yuansheng Tang;Tadao Kasami;Toru Fujiwara
Affiliations:
-;-;-
Venue:
AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Year:
1999

Citing 2
Cited 1

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 low-weight trellis-based iterative soft-decision decoding algorithm for binary linear block codes

IEEE Transactions on Information Theory

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Based on h reference words, Kasami et. al. proposed an integer programming problem (IPP) whose optimal value of the objective function gives a sufficient condition on the optimality of a decoded codeword. The IPP has been solved for 1 ≤ h ≤ 3. In this paper, an algorithm for solving the IPP for h = 4 is presented. The computational complexity of this algorithm is investigated.