New Identifying Codes in the Binary Hamming Space

European Journal of Combinatorics, Vol. 31, pp. 491-501, 2010.

Irène CHARON, Gérard COHEN, Olivier HUDRY & Antoine LOBSTEIN
Centre National de la Recherche Scientifique
Ecole Nationale Supérieure des Télécommunications
46 rue Barrault, 75634 Paris cédex 13, France
{charon, cohen, hudry, lobstein}@enst.fr

Abstract. Let Fⁿ be the binary n-cube, or binary Hamming space of dimension n, endowed with the Hamming distance. For r a nonnegative integer and x in Fⁿ, we denote by B_r(x) the ball of radius r and centre x. A set C included in Fⁿ is said to be an r-identifying code if the sets B_r(x) $\cap$ C, x in Fⁿ, are all nonempty and distinct. We give new constructive upper bounds for the minimum cardinalities of r-identifying codes in the Hamming space.

Voir aussi des codes identifiants dans l'espace de Hamming, se référant à cet article
 
Revenir à la page d'accueil