On Linear Programming Bounds for Spherical Codes and Designs

ISSN： 0179-5376

Source： Discrete & Computational Geometry, Vol.31, Iss.3, 2004-02, pp. : 385-394

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Upper Bounds on Permutation Codes via Linear Programming

By Tarnanen H.

European Journal of Combinatorics, Vol. 20, Iss. 1, 1999-01 ,pp. : 101-114

Elsevier

Access to resources Recommend Favorite

Linear Programming Bounds for Codes of Small Size

By Krasikov I. Litsyn S.

European Journal of Combinatorics, Vol. 18, Iss. 6, 1997-08 ,pp. : 647-654

Academic Press

Access to resources Recommend Favorite

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

By Bierbrauer Jürgen

Designs, Codes and Cryptography, Vol. 42, Iss. 2, 2007-02 ,pp. : 127-143

Springer Publishing Company

Access to resources Recommend Favorite

Efficiency Bounds for Product Designs in Linear Models

By Schwabe R.

Annals of the Institute of Statistical Mathematics, Vol. 51, Iss. 4, 1999-12 ,pp. : 723-730

Springer Publishing Company

Access to resources Recommend Favorite

New minimum distance bounds for linear codes over GF(5)

By Daskalov R. Hristov P. Metodieva E.

Discrete Mathematics, Vol. 275, Iss. 1, 2004-01 ,pp. : 97-110

Elsevier

Access to resources Recommend Favorite