A direct approach to linear programming bounds for codes and tms-nets
Based on a self-contained account of the classical linear programming bounds for codes and orthogonal arrays we give a simplified description of the linear programming bounds for ordered codes, ordered orthogonal arrays (OOA) and tms-nets. The main result is a description in terms of a family of polynomials which generalize the Kravchouk polynomials of coding theory. The Plotkin bound and the sphere packing bound for ordered codes are consequences. We also derive a quadratic bound and illustrate by giving some improvements for bounds on the parameters of tms-nets. © Springer Science+Business Media, LLC 2007.
Designs, Codes, and Cryptography
A direct approach to linear programming bounds for codes and tms-nets.
Designs, Codes, and Cryptography,
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/4871