Communication: Monotonicity of the minimum cardinality of an identifying code in the hypercube

  • Authors:

  • Julien Moncel

  • Affiliations:

  • CNRS - UJF, ERTé "Maths í Modeler", Groupe de Recherche GéoD - Laboratoire Leibniz, 46, avenue Félix Viallet, 38031 Grenoble Cedex, France

  • Venue:
  • Discrete Applied Mathematics
  • Year:
  • 2006

Quantified Score

Hi-index 0.04

Visualization

Abstract

Let M"t(n) denote the minimum cardinality of a t-identifying code in the n-cube. It was conjectured that for all n=2 and t=1 we have M"t(n)=