Semidefinite bounds for mixed binary/ternary codes

DOI10.1016/j.disc.2018.03.013zbMath1431.94159arXiv1606.06930OpenAlexW2467114759MaRDI QIDQ1744761

Bart Litjens

Publication date: 19 April 2018

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

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

zbMATH Keywords

upper boundssemidefinite programmingcodemixed binary/ternary code

Mathematics Subject Classification ID

Semidefinite programming (90C22) Linear codes (general theory) (94B05) Bounds on codes (94B65)

Related Items (2)

Semidefinite programming bounds for Lee codes ⋮ Symmetry Reduction to Optimize a Graph-based Polynomial From Queueing Theory

Cites Work

• Unnamed Item
• Unnamed Item
• New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
• Classification of binary/ternary one-error-correcting codes
• Semidefinite bounds for nonbinary codes based on quadruples
• New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
• Bounds on mixed binary/ternary codes
• Football Pools--A Game for Mathematicians
• Semidefinite Code Bounds Based on Quadruple Distances

This page was built for publication: Semidefinite bounds for mixed binary/ternary codes