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

Entropy

Bounds on the Probability of Undetected Error for q-Ary Codes

Xuan Wang, Huizhou Liu, Patrick Solé

Published Sep 17, 2023• 0 citations
Publisher

Abstract

-ary codes. We give upper and lower bounds on this quantity, by the Linear Programming and the Polynomial methods, as a function of the length, size, and minimum distance. Sharper bounds are obtained in the important special case of binary Hamming codes. Finally, several examples are given to illustrate the results of this paper.
DOI
10.3390/e25091349

Related papers

Linear Programming Bounds on the Kissing Number of q-ary Codes

Patrick Solé, Yi Liu, Wei Cheng +2 more

We use linear programming (LP) to derive upper and lower bounds on the “kissing number” $A_{d}$ of any q-ary linear code C with distance distribution frequencies $A_{i}$, in terms of the given parameters $[n,\ k,\ d]$. In particular, a polynomial method gives explicit analytic bounds in a certain range of parameters, which are sharp for some low-rate codes like the first-order Reed-Muller codes. The general LP bounds are more suited to numerical estimates. Besides the classical estimation of the probability of decoding error and of undetected error, we outline recent applications in hardware protection against side-channel attacks using code-based masking countermeasures, where the protection is all the more efficient a s the kissing number is low.

IEEE Information Theory Workshop (ITW)•Oct 17, 2021•15 citations

Concerning a bound on undetected error probability

Kamal Gupta

In the past, it has generally been assumed that the probability of undetected error for an (n,k) block code, used solely for error detection on a binary symmetric channel, is upper bounded by 2-(n-k). In this correspondence, it is shown that Hamming codes do indeed obey this bound, but that the bound is violated by some more general codes. Examples of linear, cyclic, and Bose-Chaudhuri-Hocquenghem (BCH) codes which do not obey the bound are given.

International Journal of Statistics and Applied Mathematics•Jan 1, 2017•1 citation

On the monotonic property of the probability of undetected error for a shortened code

Toru Fujiwara, Tadao Kasami, Shou-Ping Feng

The monotonic property of the probability of undetected error is considered when a shortened code of a linear code over GF(q) is used for error detection on a q-ary symmetric channel. Some conditions are presented under which the probability of undetected error is (or is not) monotonic with respect to the code length or the symbol error probability. It is shown that the probability of undetected error for a maximum distance separable code is monotonic with respect to the codelength. It is also shown that the probability of undetected error of a shortened code of any binary cyclic Hamming code generated by a trinomial is not monotonic with respect to the bit-error rate if the code length is short.>

IEEE Transactions on Information Theory•Jan 1, 1991•6 citations

Bounds on the Error Probability of Nonbinary Linear Codes over the Q-ary Symmetric Channel

Emna Ben Yacoub, Gianluigi Liva, Enrico Paolini

The block error probability under maximum likelihood decoding of general linear block codes and code ensembles over the q-ary symmetric channel is analyzed. The analysis makes use of two types of upper bounds and it is based on the codes (code ensembles) distance spectra. The first bound generalizes Poltyrev's union bound for the binary symmetric channel. The second bound relies on typical pairs decoding. The two bounds are developed in an asymptotic setting to analyze the behavior of linear block code ensembles, in terms of error exponent and maximum-likelihood decoding threshold. A sphere-packing lower bound is also developed, to provide a reference for the finite-length performance.

Conference on Information Sciences and Systems•Mar 24, 2021•0 citations

Quantum error detection .II. Bounds

Alexei Ashikhmin, Alexander Barg, Emanuel H. Knill +1 more

In Part II we show that there exist quantum codes whose probability of undetected error falls exponentially with the length of the code and derive bounds on this exponent.The lower (existence) bound for stabilizer codes is proved by a counting argument for classical self-orthogonal quaternary codes. Upper bounds for any quantum codes are proved by linear programming. We present two general solutions of the LP problem. Together they give an upper bound on the exponent of undetected error. The upper and lower asymptotic bounds coincide for a certain interval of code rates close to 1.

arXiv:quant-ph/9906131•IEEE Transactions on Information Theory•May 1, 2000•53 citations

Quantum error detection

Alexei Ashikhmin, Alexander Barg, Emanuel H. Knill +1 more

We show that the probability of undetected error for a quantum code on the depolarizing channel can be expressed via code's weight enumerators. We prove that there exist quantum codes whose probability of undetected error falls exponentially with the length of the code and derive a lower bound on this exponent. To derive upper bounds we formulate a linear programming problem and present two feasible programs for it. The asymptotic upper and lower bounds coincide in a certain interval of code rates close to 1.

IEEE International Symposium on Information Theory (ISIT)•Nov 7, 2002•9 citations
We use linear programming (LP) to derive upper and lower bounds on the “kissing number” AdA_{d}Ad​ of any q-ary linear code C with distance distribution frequencies AiA_{i}Ai​, in terms of the given parameters [n, k, d][n,\ k,\ d][n, k, d]. In particular, a polynomial method gives explicit analytic bounds in a certain range of parameters, which are sharp for some low-rate codes like the first-order Reed-Muller codes. The general LP bounds are more suited to numerical estimates. Besides the classical estimation of the probability of decoding error and of undetected error, we outline recent applications in hardware protection against side-channel attacks using code-based masking countermeasures, where the protection is all the more efficient a s the kissing number is low.
The monotonic property of the probability of undetected error is considered when a shortened code of a linear code over GF(q) is used for error detection on a q-ary symmetric channel. Some conditions are presented under which the probability of undetected error is (or is not) monotonic with respect to the code length or the symbol error probability. It is shown that the probability of undetected error for a maximum distance separable code is monotonic with respect to the codelength. It is also shown that the probability of undetected error of a shortened code of any binary cyclic Hamming code generated by a trinomial is not monotonic with respect to the bit-error rate if the code length is short.>
The block error probability under maximum likelihood decoding of general linear block codes and code ensembles over the q-ary symmetric channel is analyzed. The analysis makes use of two types of upper bounds and it is based on the codes (code ensembles) distance spectra. The first bound generalizes Poltyrev's union bound for the binary symmetric channel. The second bound relies on typical pairs decoding. The two bounds are developed in an asymptotic setting to analyze the behavior of linear block code ensembles, in terms of error exponent and maximum-likelihood decoding threshold. A sphere-packing lower bound is also developed, to provide a reference for the finite-length performance.
In Part II we show that there exist quantum codes whose probability of undetected error falls exponentially with the length of the code and derive bounds on this exponent.The lower (existence) bound for stabilizer codes is proved by a counting argument for classical self-orthogonal quaternary codes. Upper bounds for any quantum codes are proved by linear programming. We present two general solutions of the LP problem. Together they give an upper bound on the exponent of undetected error. The upper and lower asymptotic bounds coincide for a certain interval of code rates close to 1.
We show that the probability of undetected error for a quantum code on the depolarizing channel can be expressed via code's weight enumerators. We prove that there exist quantum codes whose probability of undetected error falls exponentially with the length of the code and derive a lower bound on this exponent. To derive upper bounds we formulate a linear programming problem and present two feasible programs for it. The asymptotic upper and lower bounds coincide in a certain interval of code rates close to 1.