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, Grenoble Cedex, France
Venue:
Discrete Applied Mathematics
Year:
2006

Citing 3
Cited 6

On the covering of vertices for fault diagnosis in hypercubes

Information Processing Letters
Bounds on identifying codes

Discrete Mathematics
On a new class of codes for identifying vertices in graphs

IEEE Transactions on Information Theory

Note: On the size of identifying codes in binary hypercubes

Journal of Combinatorial Theory Series A
New identifying codes in the binary Hamming space

European Journal of Combinatorics
An optimal result for codes identifying sets of words

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
On binary linear r-identifying codes

Designs, Codes and Cryptography
New results on variants of covering codes in Sierpiński graphs

Designs, Codes and Cryptography
Identifying codes of the direct product of two cliques

European Journal of Combinatorics

Quantified Score

Hi-index	0.05

Visualization

Abstract

Let Mt(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 Mt(n) ≤ Mt (n + 1). We prove this inequality for t = 1.