Improved Linear Programming Bounds on Sizes of Constant-Weight Codes

Details Improved Linear Programming Bounds on Sizes of Constant-Weight Codes Improved Linear Programming Bounds on Sizes of Constant-Weight Codes

2011-08-25

arxiv.org/abs/1108.5104v1

Computer Science

Information Theory

Scientific paper

Let $A(n,d,w)$ be the largest possible size of an $(n,d,w)$ constant-weight
binary code. By adding new constraints to Delsarte linear programming, we
obtain twenty three new upper bounds on $A(n,d,w)$ for $n \leq 28$. The used
techniques allow us to give a simple proof of an important theorem of Delsarte
which makes linear programming possible for binary codes.

Affiliated with

Also associated with

No associations

Rating

Improved Linear Programming Bounds on Sizes of Constant-Weight Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Improved Linear Programming Bounds on Sizes of Constant-Weight Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improved Linear Programming Bounds on Sizes of Constant-Weight Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-319252