Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences

Efficient Maximum Likelihood Decoding Algorithms for Linear Codes over Z-Channel (Special Section on Information Theory and Its Applications)

Tomohiko Uyematsu

Published Sep 25, 1993• 0 citations
OpenAlex

Related papers

On Recursive Maximum Likelihood Decoding algorithms for Linear Codes

Tadao Kasami

IEICE Technical Report; IEICE Tech. Rep.•Mar 15, 2001•1 citation

Recursive maximum-likelihood decoding algorithm for binary linear block codes

Shu Lin, Toru Fujiwara, Hiroshi Yamamoto +1 more

•Dec 1, 1997•0 citations

Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes. Part 3; A Recursive Maximum Likelihood Decoding

Shu Wen Lin, M.P.C. Fossorier

•Apr 20, 1998•0 citations

Improvements in two soft decision maximum likelihood decoding algorithms for linear block codes

W. Stieritz, Jack K. Wolf

•Jan 1, 1977•0 citations

Applications of linear programming to coding theory

Nathan Axvig

Maximum-likelihood decoding is often the optimal decoding rule one can use, but it is very costly to implement in a general setting. Much effort has therefore been dedicated to find efficient decoding algorithms that either achieve or approximate the error-correcting performance of the maximum-likelihood decoder. This dissertation examines two approaches to this problem. In 2003 Feldman and his collaborators defined the linear programming decoder, which operates by solving a linear programming relaxation of the maximum-likelihood decoding problem. As with many modern decoding algorithms, is possible for the linear programming decoder to output vectors that do not correspond to codewords; such vectors are known as pseudocodewords. In this work, we completely classify the set of linear programming pseudocodewords for the family of cycle codes. For the case of the binary symmetric channel, another approximation of maximum-likelihood decoding was introduced by Omura in 1972. This decoder employs an iterative algorithm whose behavior closely mimics that of the simplex algorithm. We generalize Omura's decoder to operate on any binary-input memoryless channel, thus obtaining a soft-decision decoding algorithm. Further, we prove that the probability of the generalized algorithm returning the maximum-likelihood codeword approaches 1 as the number of iterations goes to infinity.

•Jan 1, 2010•3 citations

Efficient decoding algorithms for linear codes on soft-quantized channels (Ph.D. Thesis abstr.)

C. Yu

IEEE Transactions on Information Theory•Nov 1, 1978•0 citations
Maximum-likelihood decoding is often the optimal decoding rule one can use, but it is very costly to implement in a general setting. Much effort has therefore been dedicated to find efficient decoding algorithms that either achieve or approximate the error-correcting performance of the maximum-likelihood decoder. This dissertation examines two approaches to this problem. In 2003 Feldman and his collaborators defined the linear programming decoder, which operates by solving a linear programming relaxation of the maximum-likelihood decoding problem. As with many modern decoding algorithms, is possible for the linear programming decoder to output vectors that do not correspond to codewords; such vectors are known as pseudocodewords. In this work, we completely classify the set of linear programming pseudocodewords for the family of cycle codes. For the case of the binary symmetric channel, another approximation of maximum-likelihood decoding was introduced by Omura in 1972. This decoder employs an iterative algorithm whose behavior closely mimics that of the simplex algorithm. We generalize Omura's decoder to operate on any binary-input memoryless channel, thus obtaining a soft-decision decoding algorithm. Further, we prove that the probability of the generalized algorithm returning the maximum-likelihood codeword approaches 1 as the number of iterations goes to infinity.