Monotonicity of the minimum cardinality of an identifying code in the hypercube. (English) Zbl 1093.94033
Summary: Let \(M_{t}(n)\) denote the minimum cardinality of a \(t\)-identifying code in the \(n\)-cube. It was conjectured that for all \(n \geq 2\) and \(t\geq 1\) we have \(M_{t}(n)\leq M_{t} (n+1)\). We prove this inequality for \(t=1\).
MSC:
| 94B60 | Other types of codes |
References:
| [1] | Blass, U.; Honkala, I.; Litsyn, S., On binary codes for identification, J. Combin. Designs, 8, 151-156 (2000) · Zbl 1016.94041 |
| [2] | Blass, U.; Honkala, I.; Litsyn, S., Bounds on identifying codes, Discrete Math., 241, 119-128 (2001) · Zbl 0991.94061 |
| [3] | Honkala, I.; Lobstein, A., On identifying codes in binary Hamming spaces, J. Combin. Theory Ser. A, 99, 232-243 (2002) · Zbl 1005.94030 |
| [4] | Karpovsky, M. G.; Chakrabarty, K.; Levitin, L. B., On a new class of codes for identifying vertices in graphs, IEEE Trans. Inform. Theory, 44, 2, 599-611 (1998) · Zbl 1105.94342 |
| [5] | Karpovsky, M. G.; Chakrabarty, K.; Levitin, L. B.; Avreky, D. R., On the covering of vertices for fault diagnosis in hypercubes, Inform. Process. Lett., 69, 99-103 (1999) · Zbl 1339.68026 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
