Technical Program

Paper Detail

Paper Title Linear Programming Bounds for Cardinality and Energy of Codes of Given Min and Max Distances
Paper IdentifierWE2.R9.4
Authors Peter Boyvalenkov, Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Bulgaria; Peter Dragnev, Purdue University Fort Wayne, United States; Douglas Hardin, Edward Saff, Vanderbilt University, United States; Maya Stoyanova, Sofia University, Bulgaria
Session Bounds on Codes
Location Pontoise, Level 5
Session Time Wednesday, 10 July, 11:40 - 13:20
Presentation Time Wednesday, 10 July, 12:40 - 13:00
Manuscript  Click here to download the manuscript
Abstract We employ 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 lower bounds on the potential energy (for absolutely monotone interactions) for codes with given maximum distance and fixed cardinality. In particular, we extend the framework of Levenshtein bounds for such codes.