Improved Linear Programming Bounds on Sizes of Constant-Weight Codes
Information Theory
2011-08-26 v1 math.IT
Abstract
Let be the largest possible size of an constant-weight binary code. By adding new constraints to Delsarte linear programming, we obtain twenty three new upper bounds on for . The used techniques allow us to give a simple proof of an important theorem of Delsarte which makes linear programming possible for binary codes.
Cite
@article{arxiv.1108.5104,
title = {Improved Linear Programming Bounds on Sizes of Constant-Weight Codes},
author = {Byung Gyun Kang and Hyun Kwang Kim and Phan Thanh Toan},
journal= {arXiv preprint arXiv:1108.5104},
year = {2011}
}