Upper Bounds on Permutation Codes via Linear Programming

Author： Tarnanen H.  

Publisher： Elsevier

ISSN： 0195-6698

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

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

Abstract

Related content

On Linear Programming Bounds for Spherical Codes and Designs

By Samorodnitsky Alex  

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

Springer Publishing Company

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

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

The Ideal Structure of Semigroups of Linear Transformations with Upper Bounds on Their Nullity or Defect

By Mendes-Goncalves Suzana  

Communications in Algebra, Vol. 37, Iss. 7, 2009-07 ,pp. : 2522-2539

Taylor & Francis Ltd

Access to resources Recommend Favorite