par Bogaerts, Mathieu
Référence The electronic journal of combinatorics, 17, 1, page (135)
Publication Publié, 2010-10-15
Article révisé par les pairs
Résumé : An (n, d)-permutation code of size s is a subset C of Sn with s elements such that the Hamming distance dH between any two distinct elements of C is at least equal to d. In this paper, we give new upper bounds for the maximal size μ(n, d) of an (n, d)-permutation code of degree n with 11 =< n =<14. In order to obtain these bounds, we use the structure of association scheme of the permutation group Sn and the irreducible characters of Sn . The upper bounds for μ(n, d) are determined solving an optimization problem with linear inequalities.

Documents en relation

DI-fusion