Semidefinite programming bounds for Lee codes

DOI10.1016/j.disc.2019.05.019zbMath1422.90033arXiv1810.05066OpenAlexW2896014810MaRDI QIDQ2312798

Sven C. Polak

Publication date: 18 July 2019

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

upper boundssemidefinite programmingShannon capacityLee codedelsarte

Mathematics Subject Classification ID

Semidefinite programming (90C22) Applications of mathematical programming (90C90)

Related Items

Symmetry Reduction to Optimize a Graph-based Polynomial From Queueing Theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
• Semidefinite bounds for mixed binary/ternary codes
• Semidefinite bounds for nonbinary codes based on quadruples
• On the theta number of powers of cycle graphs
• New upper bounds on Lee codes
• Invariant Semidefinite Programs
• New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
• THE LEE-SCHEME AND BOUNDS FOR LEE-CODES
• A comparison of the Delsarte and Lovász bounds
• On the Shannon capacity of a graph
• The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
• Semidefinite Programming Bounds for Constant-Weight Codes
• Semidefinite Code Bounds Based on Quadruple Distances