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

International Conference on Communications

Maximum Likelihood Decoding of Codes on the Z-channel

Ángela I. Barbero, Pål Gunnar Ellingsen, Susanna Spinsante, Øyvind Ytrehus

Published Jan 1, 2006• 5 citations
Publisher

Abstract

The aim of this paper is to extend some basic concepts related to the Maximum Likelihood decoding of codes on the Z-channel, which is a particular, but very important, example of an asymmetric channel. We study distance properties of linear codes over the Z-channel, in order to define a suitable metric for the implementation of a Maximum Likelihood decoder on the channel. A combinatorial expression for an approximation on the probability of incorrect Maximum Likelihood decoding is also provided, and comparisons are given to evaluate the tightness of the estimation, when a Hamming code, a Turbo code and an LDPC code are used for communicating over the Z-channel.

DOI
10.1109/icc.2006.254911

Related papers

Maximum Likelihood Decoding of Codes on the Asymmetric Z-channel

Susanna Spinsante, Ángela I. Barbero

AbstractThe aim of this paper is to extend some basic concepts related to the MaximumLikelihood decoding of codes on the Z-channel, which is a particular, but very important,example of an asymmetric channel. We study distance properties of linear codes overthe Z-channel, in order to de ne a suitable metric for the implementation of a MaximumLikelihood decoder on the channel. A combinatorial expression for an upper bound on theprobability of incorrect Maximum Likelihood decoding is also provided, and comparisonsare given to evaluate the tightness of the bound, when a Hamming code, a Turbo codeand an LDPC code are decoded on the asymmetric channel. 1 Introduction Errors induced by communications on a noisy channel or storage medium can be reduced to anydesired level by proper encoding of the information, as long as the information rate is less thanthe capacity of the channel. This fact was shown in a landmark paper by Shannon, in 1948 [1];since that time, much work has been devoted to the problem of devising ecient encoding anddecoding methods for error control in a noisy environment.In a block-coded system, the source output u represents a k-bit message, the encoder outputc represents an n-symbol codeword, the demodulator output r represents the correspondingbinary received n-tuple and the decoder output u^ represents the k-bit estimate of the encodedmessage. The decoder must produce an estimate u^ of the information sequence u based onthe received sequence r. Equivalently, since there is a one-to-one correspondence between theinformation sequence u and the codeword c, the decoder can produce an estimate ^c of thecodeword c. Obviously, u^ = u if and only if ^c = c. The strategy adopted for choosing an

•Jan 1, 2005•3 citations

Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes

G. Miller, David Burshtein

We derive both upper and lower bounds on the decoding error probability of maximum-likelihood (ML) decoded low-density parity-check (LDPC) codes. The results hold for any binary-input symmetric-output channel. Our results indicate that for various appropriately chosen ensembles of LDPC codes, reliable communication is possible up to channel capacity. However, the ensemble averaged decoding error probability decreases polynomially, and not exponentially. The lower and upper bounds coincide asymptotically, thus showing the tightness of the bounds. However, for ensembles with suitably chosen parameters, the error probability of almost all codes is exponentially decreasing, with an error exponent that can be set arbitrarily close to the standard random coding exponent.

IEEE Transactions on Information Theory•Jan 1, 2001•153 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

To the Question of Almost Maximum-Likelihood Decoding

Mikhail Afanasev, Andrei A. Ovchinnikov

Evseev’s lemma claims that if we use the decoding by a standard array and use coset leaders having the weight not greater than Gilbert-Varshamov distance then the probability of error decoding will become not greater than the probability of error decoding of maximum-likelihood multiplied by two. However, the estimation of tightness of this bound is an open problem. In this work we perform the estimation of the accuracy of Evseev’s lemma on the example of several linear random codes by simulating them in a binary-symmetric channel.

Wave Electronics and its Application in Information and Telecommunication Systems (WECONF)•Jun 1, 2020•1 citation

Bounds on Maximum Likelihood Decoding Performance for Linear Codes at Low Rates

Hideki Yagi, H. Vincent Poor

For a given linear code (ensemble), upper bounds on the error probability under maximum likelihood decoding are investigated at low rates. A class of symmetric memoryless channels suitable for Bhattacharyya-type bounds, which are particularly of importance at low rates, is introduced. Over a symmetric channel, a lower bound on the error exponent is derived for a given linear code. A sufficient condition for achieving the expurgated exponent, which is the best among known error exponents at low rates, within a fixed discrepancy is given. Over a general discrete memoryless channel, the same analysis provides a lower bound on the average error exponent for an ensemble of coset codes generated by a given linear code. The bounding technique is extended to the case of generalized maximum likelihood decoding with erasure and list- decoding options.

IEEE Transactions on Information Theory•Mar 12, 2013•2 citations

Performance Analysis of Linear Codes under Maximum-Likelihood Decoding: A Tutorial

Igal Sason, Shlomo Shitz Shamai

Performance Analysis of Linear Codes under Maximum-Likelihood Decoding: A Tutorial focuses on the performance evaluation of linear codes under optimal maximum-likelihood (ML) decoding. Though the ML decoding algorithm is prohibitively complex for most practical codes, their performance analysis under ML decoding allows to predict their performance without resorting to computer simulations. It also provides a benchmark for testing the sub-optimality of iterative (or other practical) decoding algorithms. This analysis also establishes the goodness of linear codes (or ensembles), determined by the gap between their achievable rates under optimal ML decoding and information theoretical limits. In Performance Analysis of Linear Codes under Maximum-Likelihood Decoding: A Tutorial, upper and lower bounds on the error probability of linear codes under ML decoding are surveyed and applied to codes and ensembles of codes on graphs. For upper bounds, we discuss various bounds where focus is put on Gallager bounding techniques and their relation to a variety of other reported bounds. Within the class of lower bounds, we address de Caen's based bounds and their improvements, and also consider sphere-packing bounds with their recent improvements targeting codes of moderate block lengths. Performance Analysis of Linear Codes under Maximum-Likelihood Decoding: A Tutorial is a comprehensive introduction to this important topic for students, practitioners and researchers working in communications and information theory.

now publishers, Inc. eBooks•Jan 1, 2006•172 citations
The aim of this paper is to extend some basic concepts related to the Maximum Likelihood decoding of codes on the Z-channel, which is a particular, but very important, example of an asymmetric channel. We study distance properties of linear codes over the Z-channel, in order to define a suitable metric for the implementation of a Maximum Likelihood decoder on the channel. A combinatorial expression for an approximation on the probability of incorrect Maximum Likelihood decoding is also provided, and comparisons are given to evaluate the tightness of the estimation, when a Hamming code, a Turbo code and an LDPC code are used for communicating over the Z-channel.
AbstractThe aim of this paper is to extend some basic concepts related to the MaximumLikelihood decoding of codes on the Z-channel, which is a particular, but very important,example of an asymmetric channel. We study distance properties of linear codes overthe Z-channel, in order to de ne a suitable metric for the implementation of a MaximumLikelihood decoder on the channel. A combinatorial expression for an upper bound on theprobability of incorrect Maximum Likelihood decoding is also provided, and comparisonsare given to evaluate the tightness of the bound, when a Hamming code, a Turbo codeand an LDPC code are decoded on the asymmetric channel. 1 Introduction Errors induced by communications on a noisy channel or storage medium can be reduced to anydesired level by proper encoding of the information, as long as the information rate is less thanthe capacity of the channel. This fact was shown in a landmark paper by Shannon, in 1948 [1];since that time, much work has been devoted to the problem of devising ecient encoding anddecoding methods for error control in a noisy environment.In a block-coded system, the source output u represents a k-bit message, the encoder outputc represents an n-symbol codeword, the demodulator output r represents the correspondingbinary received n-tuple and the decoder output u^ represents the k-bit estimate of the encodedmessage. The decoder must produce an estimate u^ of the information sequence u based onthe received sequence r. Equivalently, since there is a one-to-one correspondence between theinformation sequence u and the codeword c, the decoder can produce an estimate ^c of thecodeword c. Obviously, u^ = u if and only if ^c = c. The strategy adopted for choosing an
We derive both upper and lower bounds on the decoding error probability of maximum-likelihood (ML) decoded low-density parity-check (LDPC) codes. The results hold for any binary-input symmetric-output channel. Our results indicate that for various appropriately chosen ensembles of LDPC codes, reliable communication is possible up to channel capacity. However, the ensemble averaged decoding error probability decreases polynomially, and not exponentially. The lower and upper bounds coincide asymptotically, thus showing the tightness of the bounds. However, for ensembles with suitably chosen parameters, the error probability of almost all codes is exponentially decreasing, with an error exponent that can be set arbitrarily close to the standard random coding exponent.
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.
Evseev’s lemma claims that if we use the decoding by a standard array and use coset leaders having the weight not greater than Gilbert-Varshamov distance then the probability of error decoding will become not greater than the probability of error decoding of maximum-likelihood multiplied by two. However, the estimation of tightness of this bound is an open problem. In this work we perform the estimation of the accuracy of Evseev’s lemma on the example of several linear random codes by simulating them in a binary-symmetric channel.
For a given linear code (ensemble), upper bounds on the error probability under maximum likelihood decoding are investigated at low rates. A class of symmetric memoryless channels suitable for Bhattacharyya-type bounds, which are particularly of importance at low rates, is introduced. Over a symmetric channel, a lower bound on the error exponent is derived for a given linear code. A sufficient condition for achieving the expurgated exponent, which is the best among known error exponents at low rates, within a fixed discrepancy is given. Over a general discrete memoryless channel, the same analysis provides a lower bound on the average error exponent for an ensemble of coset codes generated by a given linear code. The bounding technique is extended to the case of generalized maximum likelihood decoding with erasure and list- decoding options.
Performance Analysis of Linear Codes under Maximum-Likelihood Decoding: A Tutorial focuses on the performance evaluation of linear codes under optimal maximum-likelihood (ML) decoding. Though the ML decoding algorithm is prohibitively complex for most practical codes, their performance analysis under ML decoding allows to predict their performance without resorting to computer simulations. It also provides a benchmark for testing the sub-optimality of iterative (or other practical) decoding algorithms. This analysis also establishes the goodness of linear codes (or ensembles), determined by the gap between their achievable rates under optimal ML decoding and information theoretical limits. In Performance Analysis of Linear Codes under Maximum-Likelihood Decoding: A Tutorial, upper and lower bounds on the error probability of linear codes under ML decoding are surveyed and applied to codes and ensembles of codes on graphs. For upper bounds, we discuss various bounds where focus is put on Gallager bounding techniques and their relation to a variety of other reported bounds. Within the class of lower bounds, we address de Caen's based bounds and their improvements, and also consider sphere-packing bounds with their recent improvements targeting codes of moderate block lengths. Performance Analysis of Linear Codes under Maximum-Likelihood Decoding: A Tutorial is a comprehensive introduction to this important topic for students, practitioners and researchers working in communications and information theory.