Energy bounds for codes and designs in Hamming spaces

DOI10.1007/s10623-016-0286-4zbMath1381.94137arXiv1510.03406OpenAlexW2306519013MaRDI QIDQ510492

P. G. Boyvalenkov, M. M. Stoyanova, Douglas P. Hardin, Edward B. Saff, Peter D. Dragnev

Publication date: 10 February 2017

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.03406

zbMATH Keywords

potential functionsHamming spaceerror-correcting codes\(\tau\)-designsenergy of a code

Mathematics Subject Classification ID

Bounds on codes (94B65) Other designs, configurations (05B30)

Related Items

STOLARSKY'S INVARIANCE PRINCIPLE FOR FINITE METRIC SPACES ⋮ Upper bounds for energies of spherical codes of given cardinality and separation ⋮ On spherical codes with inner products in a prescribed interval ⋮ Energy bounds for codes in polynomial metric spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Universal lower bounds for potential energy of spherical codes
• Designs as maximum codes in polynomial metric spaces
• On linear programming bounds for codes in polynomial metric spaces
• Necessary conditions for existence of some designs in polynomial metric spaces
• Orthogonal arrays. Theory and applications
• Constrained energy problems with applications to orthogonal polynomials of a discrete variable
• A problem in potential theory and zero asymptotics of Krawtchouk polynomials
• Energy-Minimizing Error-Correcting Codes
• Universally optimal distribution of points on spheres
• The minimum of potential energy of a System of point charges
• Estimates of the distance distribution of codes and designs
• Association schemes and coding theory
• Binomial moments of the distance distribution: bounds and applications
• Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces
• Asymptotics for discrete weighted minimal Riesz energy problems on rectifiable sets