New inequalities for \(q\)-ary constant-weight codes

DOI10.1007/S10623-014-9924-XzbMath1335.94107arXiv1212.6453OpenAlexW2068873309MaRDI QIDQ398941

Phan Thanh Toan, Hyun Kwang Kim

Publication date: 18 August 2014

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

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

zbMATH Keywords

linear programmingbinary code\(q\)-ary codeDelsarte inequalities

Mathematics Subject Classification ID

Bounds on codes (94B65)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simple proof of the Delsarte inequalities
• New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
• On the Delsarte inequalities
• Ternary constant weight codes
• Delsarte's Linear Programming Bound for Constant-Weight Codes
• New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
• Fundamentals of Error-Correcting Codes
• Improved upper bounds on sizes of codes
• Semidefinite Code Bounds Based on Quadruple Distances
• Improved Semidefinite Programming Bound on Sizes of Codes

This page was built for publication: New inequalities for \(q\)-ary constant-weight codes