Energy-Minimizing Error-Correcting Codes

  title={Energy-Minimizing Error-Correcting Codes},
  author={Henry Cohn and Yufei Zhao},
  journal={IEEE Transactions on Information Theory},
  • Henry Cohn, Yufei Zhao
  • Published 9 December 2012
  • Computer Science
  • IEEE Transactions on Information Theory
We study a discrete model of repelling particles, and we show using linear programming bounds that many familiar families of error-correcting codes minimize a broad class of potential energies when compared with all other codes of the same size and block length. Examples of these universally optimal codes include Hamming, Golay, and Reed-Solomon codes, among many others, and this helps to explain their robustness as the channel model varies. Universal optimality of these codes is equivalent to… 

Tables from this paper

Universal Bounds for Size and Energy of Codes of Given Minimum and Maximum Distances
Levenshtein-type upper bounds on the cardinality of codes with given minimum and maximum distances and cardinality are established and universal lower bounds are obtained on the potential energy for absolutely monotone interactions.
On Linear Ordered Codes
The Tutte polynomial is related to the distribution of support shapes of linear ordered codes, and this distribution for ordered MDS codes is found, and a duality relation for the TuttePolynomial of the code and its dual code is proved.
Optimal simplices and codes in projective spaces
We find many tight codes in compact spaces, i.e., optimal codes whose optimality follows from linear programming bounds. In particular, we show the existence (and abundance) of several hitherto
Stolarsky's invariance principle for finite metric spaces
This work derives several equivalent versions of the expression for the discrepancy of a code, including expansions of the discrepancy and associated kernels in the Krawtchouk basis, and shows that all binary perfect codes have the smallest possible discrepancy.
On spherical codes with inner products in a prescribed interval
An intricate relationship between Levenshtein-type upper bounds on cardinality of codes with inner products in $$[\ell ,s]$$[ℓ,s] and lower bounds on the potential energy (for absolutely monotone interactions) for codes with Inner Products 1 (when the Cardinality of the code is kept fixed) is revealed and explained.
Linear Programming Bounds for Cardinality and Energy of Codes of Given Min and Max Distances
This work employs signed measures that are positive definite up to certain degrees to establish Levenshtein-type upper bounds on the cardinality of codes with given minimum and maximum distance, and universal lower limits on the potential energy for codes withgiven maximum distance and fixed cardinality.
Energy bounds for codes and designs in Hamming spaces
Borders on the energy of codes and designs in Hamming spaces hold for a large class of potential functions, allow a unified treatment, and can be viewed as a generalization of the Levenshtein bounds for maximal codes.
Distance Distributions and Energy of Designs in Hamming Spaces
We obtain new combinatorial upper and lower bounds for the potential energy of designs in q-ary Hamming space. Combined with results on reducing the number of all feasible distance distributions of
High-dimensional sphere packing and the modular bootstrap
A more detailed picture of the behavior for finite $c$ is given than was previously available, and an exponential improvement for sphere packing density bounds in high dimensions is extrapolated.
Packing, coding, and ground states
These are the lecture notes from my 2014 PCMI graduate summer school lectures. In these lectures, we'll study simple models of materials from several different perspectives: geometry (packing


A survey of perfect codes
  • O. Heden
  • Computer Science
    Adv. Math. Commun.
  • 2008
This survey paper is devoted to the rather many recent results, that have appeared during the last ten years, on perfect 1-error correcting binary codes.
Bounds for unrestricted codes, by linear programming
The present paper starts from the observation that the distance distribution of an unrestricted code (over an unrestricted alphabet) yields nonnegative numbers when substituted to the right-hand member of (1) and gives an upper bound for the number of words in codes having a designed set of distances.
Theory of Error-correcting Codes
This course expounds the principles of coded modulations for the Gaussian channel and, if time permits, for Rician and Rayleigh fading channels (fully interleaved), and reminds students of the basics of the theory of linear codes for conventional memoryless ergodic channels.
Spin-glass models as error-correcting codes
It is shown that theoretical models of magnetically disordered materials (spin glasses) provide a new class of error-correction codes that can, under certain circumstances, constitute the first known codes to saturate Shannon's well-known cost-performance bounds.
Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces
Universal bounds for the cardinality of codes in the Hamming space F/sub r//sup n/ with a given minimum distance d and/or dual distance d' are stated. A self-contained proof of optimality of these
Linear programming-based optimization of the distance spectrum of linear block codes
The results suggest that the best distance spectrum is not a function of signal-to-noise ratio (SNR) above the cutoff rate SNR and also suggest the existence of several unknown, good codes.
Binomial moments of the distance distribution: bounds and applications
  • A. Ashikhmin, A. Barg
  • Computer Science, Mathematics
    Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)
  • 1998
New lower bounds are obtained on the probability of undetected error of binary codes on the binary symmetric channel (BSC) which improve previously known results and derive new asymptotic upper bounds on the exponent of undetection error.
Association Schemes and Coding Theory
This paper contains a survey of association scheme theory (with its algebraic and analytical aspects) and of its applications to coding theory (in a wide sense); some "universal bounds" are derived for codes and designs in polynomial type association schemes.
Three-point bounds for energy minimization
It is proved that the seven lines connecting opposite vertices of a cube and of its dual octahedron are universally optimal, which is the only known universal optimum that is not distance regular, and the last remaining universal optimum in RP^2.
New Conjectural Lower Bounds on the Optimal Density of Sphere Packings
An optimization procedure is precisely the dual of a primal linear program devised by Cohn and Elkies to obtain upper bounds on the density, and hence has implications for linear programming bounds, and proves that the density estimate can never exceed the Cohn– Elkies upper bound.