Abstract
We give an alternative proof of Delsarte'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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have