Upper bounds on permutation codes via linear programming

European Journal of Combinatorics

Volumn 20, Issue 1, 1999, Pages 101-114

  Tarnanen, Hannu ^a  

^a UNIVERSITY OF TURKU   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033482899     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1006/eujc.1998.0272     Document Type: Article

References (11)

1. E. Bannai and T. Ito, Algebraic Combinatorics I, Benjamin-Cummings, Menlo Park, CA, 1984.
2. I. F. Blake, G. Cohen and M. Deza, Coding with permutations, Inform. Control, 43 (1979), 1-19.
3. P. Delsarte, An algebraic approach to the association schemes of coding theory, Philips Res. Rep. Suppl., 10 (1973).
4. P. Frankl and M. Deza, On the maximum number of permutations with given maximal or minimal distance, J. Comb. Theory Ser. A, 22 (1977), 352-360.
5. C. D. Godsil, Algebraic Combinatorics, Chapman & Hall, New York, 1993.
6. I. M. Isaacs, Character Theory of Finite Groups, Academic Press, New York, 1976.
7. G. D. James and A. Kerber, The Representation Theory of Symmetric Groups, Addison-Wesley, New York, 1981.
8. M. Kiyota, An inequality for finite permutation groups, J. Comb. Theory Ser. A, 27 (1979), 119.
9. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland, New York, 1977.
10. G. de B. Robinson, Representation Theory of the Symmetric Group, University of Toronto Press, Toronto, 1961.
11. S. Wolfram, Mathematica, A System for Doing Mathematics by Computer, Addison-Wesley, Redwood City, CA, 1991.