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

IEEE International Symposium on Information Theory (ISIT)

Zero-rate Reliability Function for Mismatched Decoding

Marco Bondaschi, Albert Guillén i Fàbregas, Marco Dalai

Published Jul 12, 2021• 1 citation
Publisher

Abstract

We derive an upper bound on the reliability function of mismatched decoding for zero-rate codes. The bound is based on a result by Komlós that shows the existence of a subcode with certain symmetry properties. The bound is shown to coincide with the expurgated exponent at rate zero for a broad family of channel and decoding metric pairs. A full version of this paper is accessible at: https://arxiv.org/pdf/2101.10238.pdf

DOI
10.1109/isit45174.2021.9517804

Related papers

Exponent of the probability of list-of-L decoding error at low rates

Vladimir M. Blinovsky

There exists a lot of works devoted to obtaining the bound for the exponent of the probability of error in different channels. In this paper we prove that the expurgation exponent of the list-of-L decoding error is tight at zero rate.

IEEE International Symposium on Information Theory (ISIT)•Nov 13, 2002•2 citations

Upper Bounds on the Error Probability for the Ensemble of Linear Block Codes with Mismatched Decoding

Toshihiro Niinomi, Hideki Yagi, Shigeichi Hirasawa

In channel decoding, a decoder with suboptimal metrics may be used because of the uncertainty of the channel statistics or the limitations of the decoder. In this case, the decoding metric is different from the actual channel metric, and thus it is called mismatched decoding. In this paper, applying the technique of the DS2 bound, we derive an upper bound on the error probability of mismatched decoding over a regular channel for the ensemble of linear block codes, which was defined by Hof, Sason and Shamai. Assuming the ensemble of random linear block codes defined by Gallager, we show that the obtained bound is not looser than the conventional bound. We also give a numerical example for the ensemble of LDPC codes also introduced by Gallager, which shows that our proposed bound is tighter than the conventional bound. Furthermore, we obtain a single letter error exponent for linear block codes.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Oct 7, 2021•1 citation

Performance analysis of linear codes under maximum likelihood decoding at low rates

Hideki Yagi, H. Vincent Poor

Or a given linear code, a lower bound on the error exponent under maximum likelihood decoding is investigated at low rates. or a given linear code, a lower bound on the error exponent under maximum likelihood decoding is investigated at low rates. F In the analysis of the decoding error probability, it is important to characterize the error exponent, since it indicates how fast the probability of decoding error converges to zero asymptotically. Over a symmetric memoryless channel, an 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, is given. Over a general discrete memoryless channel, the same analysis shows the expected error exponent of an ensemble of coset codes generated by a given linear code.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2010•0 citations

Reliability function of general classical-quantum channel

A. S. Holevo

In information theory the reliability function and its bounds, describing the exponential behavior of the error probability, are the most important quantitative characteristics of the channel performance. From a general point of view, these bounds provide certain measures of distinguishability of a given set of states. In an earlier paper we introduced quantum analogs of the random coding and the expurgation lower bounds for the case of pure signal states. Here we discuss the general case, in particular, we prove the previously conjectured expurgation bound and find the quantum cutoff rate in the case of arbitrary mixed signal states.

•Jul 28, 1999•53 citations

Remark on the reliability function of a symmetric channel under list decoding

Vladimir M. Blinovsky

We complete the derivation of a formula for the reliability function of a q -ary symmetric channel under list decoding at zero rate.

Problems of Information Transmission•Jun 1, 2011•0 citations

About the reliability function of symmetric channel under list decoding

Vladimir M. Blinovsky

We complete the derivation of the formula for the reliability function of q-ary symmetric channel under list decoding for zero rate.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2011•0 citations
We derive an upper bound on the reliability function of mismatched decoding for zero-rate codes. The bound is based on a result by Komlós that shows the existence of a subcode with certain symmetry properties. The bound is shown to coincide with the expurgated exponent at rate zero for a broad family of channel and decoding metric pairs. A full version of this paper is accessible at: https://arxiv.org/pdf/2101.10238.pdf
In channel decoding, a decoder with suboptimal metrics may be used because of the uncertainty of the channel statistics or the limitations of the decoder. In this case, the decoding metric is different from the actual channel metric, and thus it is called mismatched decoding. In this paper, applying the technique of the DS2 bound, we derive an upper bound on the error probability of mismatched decoding over a regular channel for the ensemble of linear block codes, which was defined by Hof, Sason and Shamai. Assuming the ensemble of random linear block codes defined by Gallager, we show that the obtained bound is not looser than the conventional bound. We also give a numerical example for the ensemble of LDPC codes also introduced by Gallager, which shows that our proposed bound is tighter than the conventional bound. Furthermore, we obtain a single letter error exponent for linear block codes.
Or a given linear code, a lower bound on the error exponent under maximum likelihood decoding is investigated at low rates. or a given linear code, a lower bound on the error exponent under maximum likelihood decoding is investigated at low rates. F In the analysis of the decoding error probability, it is important to characterize the error exponent, since it indicates how fast the probability of decoding error converges to zero asymptotically. Over a symmetric memoryless channel, an 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, is given. Over a general discrete memoryless channel, the same analysis shows the expected error exponent of an ensemble of coset codes generated by a given linear code.
In information theory the reliability function and its bounds, describing the exponential behavior of the error probability, are the most important quantitative characteristics of the channel performance. From a general point of view, these bounds provide certain measures of distinguishability of a given set of states. In an earlier paper we introduced quantum analogs of the random coding and the expurgation lower bounds for the case of pure signal states. Here we discuss the general case, in particular, we prove the previously conjectured expurgation bound and find the quantum cutoff rate in the case of arbitrary mixed signal states.