Energy bounds for codes and designs in Hamming spaces
Peter G. Boyvalenkov, Peter D. Dragnev, Douglas P. Hardin, Edward B., Saff, Maya M. Stoyanova

TL;DR
This paper establishes universal energy bounds for codes and designs in Hamming spaces, extending previous bounds and accommodating various potential functions for a unified theoretical framework.
Contribution
It introduces a generalized approach to bounding the energy of codes and designs, broadening the scope of Levenshtein bounds in Hamming spaces.
Findings
Universal energy bounds applicable to a wide class of potential functions
Unified framework generalizing Levenshtein bounds
Applicable to both codes and designs in Hamming spaces
Abstract
We obtain universal bounds on the energy of codes and for designs in Hamming spaces. Our bounds hold for a large class of potential functions, allow unified treatment, and can be viewed as a generalization of the Levenshtein bounds for maximal codes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Approximation and Integration · Coding theory and cryptography · Limits and Structures in Graph Theory
