Loading [MathJax]/extensions/MathMenu.js
Linear Programming Bounds for Cardinality and Energy of Codes of Given Min and Max Distances | IEEE Conference Publication | IEEE Xplore

Linear Programming Bounds for Cardinality and Energy of Codes of Given Min and Max Distances


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 m...Show More

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 universal 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.
Date of Conference: 07-12 July 2019
Date Added to IEEE Xplore: 26 September 2019
ISBN Information:

ISSN Information:

Conference Location: Paris, France

References

References is not available for this document.