Delsarte's Linear Programming Bound for Constant-Weight Codes

DOI10.1109/TIT.2012.2201445MaRDI QIDQ2989787zbMATH OpenFDO

Authors B. G. Kang, Hyun Kwang Kim, Phan Thanh Toan

Publication date 8 June 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2012.2201445

Mathematics Subject Classification ID

Linear programming (90C05) Applications of mathematical programming (90C90) Bounds on codes (94B65)

Cited in

(6)

• Improved linear programming bound on sizes of doubly constant-weight codes
• scientific article; zbMATH DE number 5299829 (Why is no real title available?)
• New inequalities for q-ary constant-weight codes
• scientific article; zbMATH DE number 5593350 (Why is no real title available?)
• A Bound for the Maximum Weight of a Linear Code
• One more proof of the first linear programming bound for binary codes and two conjectures

This page was built for publication: Delsarte's Linear Programming Bound for Constant-Weight Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989787)