Delsarte%26apos;s Linear Programming Bound for Constant-Weight Codes

作者：Kang Byung Gyun^*; Kim Hyun Kwang; Phan Thanh Toan

来源：IEEE Transactions on Information Theory, 2012, 58(9): 5956-5962.

DOI：10.1109/TIT.2012.2201445

• Binary codes
• binary constant-weight codes
• Delsarte%26apos
• s linear programming bound
• upper bound

We give an alternative proof of Delsarte%26apos;s linear programming bound for binary codes and its improvements. Applying the technique which is used in the proof to binary constant-weight codes, we obtain new upper bounds on sizes of binary constant-weight codes.

• 出版日期2012-9