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 Information Theory Workshop (ITW)

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

Patrick Solé, Yi Liu, Wei Cheng, Sylvain Guilley, Olivier Riou

Published Oct 17, 2021• 15 citations
Publisher

Abstract

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.

DOI
10.1109/itw48936.2021.9611478

Related papers

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

Xuan Wang, Huizhou Liu, Patrick Solé

-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.

Entropy•Sep 17, 2023•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

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

Improved Linear Programming Decoding of LDPC Codes and Bounds on the Minimum and Fractional Distance

David Burshtein, Idan Goldenberg

We examine LDPC codes decoded using linear programming (LP). Four contributions to the LP framework are presented. First, a new method of tightening the LP relaxation, and thus improving the LP decoder, is proposed. Second, we present an algorithm which calculates a lower bound on the minimum distance of a specific code. This algorithm exhibits complexity which scales quadratically with the block length. Third, we propose a method to obtain a tight lower bound on the fractional distance, also with quadratic complexity, and thus less than previously-existing methods. Finally, we show how the fundamental LP polytope for generalized LDPC codes and nonbinary LDPC codes can be obtained.

arXiv:1012.1425•IEEE Transactions on Information Theory•Jul 21, 2011•14 citations

Linear Programming Bounds for Multi-level Unequal Protection Codes

Tomohiko Saito, Toshiyasu Matsushima, Shigeichi Hirasawa

In coding theory, it is important to find upper bounds for the code size given a code length and minimum distance. The Hamming bounds and Linear Programming (LP) bounds were proposed in previous works. On the other hand, Masnick et al. proposed Unequal Error Protection (UEP) codes and modified Hamming bounds as upper bounds for the code size of UEP codes. In our previous work, we defined 2-level UEP codes as a subclass of UEP codes, and derived LP bounds for 2-level UEP codes. In this paper, we define multi-level UEP codes by extending 2-level UEP codes, and derive LP bounds for multi-level UEP codes. Moreover, we show that LP bounds for UEP codes are tighter upper bound than modified Hamming bounds.

Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics•Oct 1, 2018•1 citation

Linear programming bounds on the degree distributions of LDPC code ensembles

Igal Sason

This work considers the behavior of the degree distributions of capacity-approaching low-density parity-check (LDPC) code ensembles via linear programming (LP) bounds. These LP bounds are information-theoretic, and they apply to finite-length LDPC codes and to the asymptotic case of an infinite block length. Analytical solutions of these bounds are given in closed form, and the bounds are compared for the BEC with some specific degree distributions of capacity-achieving sequences of LDPC code ensembles. These LP bounds are shown to be informative and are easy to calculate. Due to space limitations, the derivation of the LP bounds is outlined, and the reader is referred to the full paper version for complete proofs and further discussions.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2009•3 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.
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.
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.
We examine LDPC codes decoded using linear programming (LP). Four contributions to the LP framework are presented. First, a new method of tightening the LP relaxation, and thus improving the LP decoder, is proposed. Second, we present an algorithm which calculates a lower bound on the minimum distance of a specific code. This algorithm exhibits complexity which scales quadratically with the block length. Third, we propose a method to obtain a tight lower bound on the fractional distance, also with quadratic complexity, and thus less than previously-existing methods. Finally, we show how the fundamental LP polytope for generalized LDPC codes and nonbinary LDPC codes can be obtained.
In coding theory, it is important to find upper bounds for the code size given a code length and minimum distance. The Hamming bounds and Linear Programming (LP) bounds were proposed in previous works. On the other hand, Masnick et al. proposed Unequal Error Protection (UEP) codes and modified Hamming bounds as upper bounds for the code size of UEP codes. In our previous work, we defined 2-level UEP codes as a subclass of UEP codes, and derived LP bounds for 2-level UEP codes. In this paper, we define multi-level UEP codes by extending 2-level UEP codes, and derive LP bounds for multi-level UEP codes. Moreover, we show that LP bounds for UEP codes are tighter upper bound than modified Hamming bounds.
This work considers the behavior of the degree distributions of capacity-approaching low-density parity-check (LDPC) code ensembles via linear programming (LP) bounds. These LP bounds are information-theoretic, and they apply to finite-length LDPC codes and to the asymptotic case of an infinite block length. Analytical solutions of these bounds are given in closed form, and the bounds are compared for the BEC with some specific degree distributions of capacity-achieving sequences of LDPC code ensembles. These LP bounds are shown to be informative and are easy to calculate. Due to space limitations, the derivation of the LP bounds is outlined, and the reader is referred to the full paper version for complete proofs and further discussions.