Energy bounds for codes and designs in Hamming spaces
Designs, Codes, and Cryptography
Place of Publication
Springer First Online
We obtain universal bounds on the energy of codes and designs in Hamming spaces. Our bounds 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.
Hamming space, Potential functions, Energy of a code, Error-correcting codes, t-designs
Analysis | Discrete Mathematics and Combinatorics | Mathematics
Peter Boyvalenkov, Peter D. Dragnev, Douglas Hardin, Edward Saff, and Maya Stoyanova (2016).
Energy bounds for codes and designs in Hamming spaces. Designs, Codes, and Cryptography. 1-23. Springer First Online: Springer Netherlands.
This document is currently not available here.