Delsarte's Linear Programming Bound for Constant-Weight Codes

DOI10.1109/TIT.2012.2201445zbMATH Open1364.94782MaRDI QIDQ2989787FDOQ2989787

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)

Mathematics Subject Classification ID

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

Cited In (6)

• One more proof of the first linear programming bound for binary codes and two conjectures
• New inequalities for \(q\)-ary constant-weight codes
• A Bound for the Maximum Weight of a Linear Code
• Title not available (Why is that?)
• Improved linear programming bound on sizes of doubly constant-weight codes
• Title not available (Why is that?)

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)