Designs, Codes and Cryptography

, Volume 42, Issue 2, pp 127–143 | Cite as

A direct approach to linear programming bounds for codes and tms-nets

  • Jürgen BierbrauerEmail author


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.


Linear programming bounds Codes Orthogonal arrays tms-nets Ordered orthogonal arrays Kravchouk polynomial Duality Plotkin bound Rao bound Lloyd polynomial 

AMS Classifications

11K38 11K45 94B65 05E30 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bierbrauer J (2004) Introduction to coding theory. Chapman & Hall/CRC PressGoogle Scholar
  2. 2.
    Delsarte P (1972) Bounds for unrestricted codes by linear programming. Philips Res Rep 27: 272–289zbMATHMathSciNetGoogle Scholar
  3. 3.
    Delsarte P (1973) Four fundamental parameters of a code and their combinatorial significance. Inform Control 23:407–438CrossRefMathSciNetGoogle Scholar
  4. 4.
    Delsarte P (1973) An algebraic approach to the association schemes of coding theory. Philips Res Rep Suppl 10Google Scholar
  5. 5.
    Martin WJ, Stinson DR (1999) A generalized Rao bound for ordered orthogonal arrays and (t,m,s)-nets. Can Math Bull 42:359–370zbMATHMathSciNetGoogle Scholar
  6. 6.
    Martin WJ, Stinson DR (1999) Association schemes for ordered orthogonal arrays and (t,m,s)-nets. Can J Math 51:326–346zbMATHMathSciNetGoogle Scholar
  7. 7.
    Martin WJ (2000) Linear programming bounds for ordered orthogonal arrays and (t,m,s)-nets. In: Niederreiter H, Spanier J (eds), Monte Carlo and Quasi-Monte Carlo methods 1998. Springer, Berlin, pp 368–376Google Scholar
  8. 8.
    Martin WJ (2001) Design systems: combinatorial characterizations of Delsarte T-designs via partially ordered sets. In: Barg A, Litsyn S (eds), Codes and Association Schemes, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol 56. American Mathematical Society pp 223–239Google Scholar
  9. 9.
    Martin WJ, Visentin TI A dual Plotkin bound for (t,m,s)-nets, manuscriptGoogle Scholar
  10. 10.
    Niederreiter H (1987) Point sets and sequences with small discrepancy. Monatsh Math 104: 273–337zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Schürer R, Schmid WCh MinT: a database for optimal net parameters. In: Niederreiter H, Talay D (eds) Monte Carlo and Quasi-Monte Carlo Methods 2004. Springer-Verlag, Berlin, pp 457–469Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2006

Authors and Affiliations

  1. 1.Department of Mathematical SciencesMichigan Technological UniversityHoughtonUSA

Personalised recommendations