New bounds on binary identifying codes
\((r,\leq l)\)-identifying codes were introduced by \textit{M. Karpovsky, K. Chakrabarty} and \textit{L. Levitin} [IEEE Trans. Inform. Theory 44, No. 2, 599--611 (1998; Zbl 1105.94342)]. One interesting application of identifying codes is to locate faulty processors in a multiprocessor system. In this article the authors improve known lower bounds on the cardinalities of \((r,\leq 1)\)-identifying codes, combining counting arguments with partial constructions. By using computational methods they also show that the smallest possible cardinality of an \((1,\leq 1)\)-identifying code of length 6 is 18, closing an open question. The last part of the article is focused on constructing \((r,\leq l)\)-identifying codes for \(r\geq 2\) and \(l\geq 2\).
- Upper bounds for binary identifying codes
- Bounds on identifying codes
- New identifying codes in the binary Hamming space
- Improved bounds on identifying codes in binary Hamming spaces
- Revisiting and improving upper bounds for identifying codes
- On binary linear \(r\)-identifying codes
- On the size of identifying codes in binary hypercubes
- New upper bounds for binary covering codes
- New lower bounds for binary covering codes
- On identifying codes in binary Hamming spaces
- Bounds on identifying codes
- Do most binary linear codes achieve the Goblick bound on the covering radius? (Corresp.)
- Extremal cardinalities for identifying and locating-dominating codes in graphs
- scientific article; zbMATH DE number 1024657 (Why is no real title available?)
- scientific article; zbMATH DE number 1436153 (Why is no real title available?)
- Improved Upper Bounds on Binary Identifying Codes
- On a new class of codes for identifying vertices in graphs
- On codes identifying sets of vertices in Hamming spaces
- On identifying codes in the hexagonal mesh
- On Identifying Codes in the Triangular and Square Grids
- On the density of identifying codes in the square lattice
- Sequences of optimal identifying codes
- Two families of optimal identifying codes in binary Hamming spaces
- Upper bounds for binary identifying codes
- On the size of identifying codes in binary hypercubes
- Optimal codes for strong identification
- On two variations of identifying codes
- Constructions of r-identifying codes and (r, l)-identifying codes
- A novel maximum distance separable code to generate universal identifiers
- Identifying codes and searching with balls in graphs
- New lower bound for 2-identifying code in the square grid
- Locating-domination and identification
- New results in binary multiple descriptions
- Sequences of optimal identifying codes
- Bound of \(r\)-identifying and \(r\)-locating-dominating codes in the Kronecker product graph of \(cy_n\) and \(\overline{k}_2\)
- Bounds on r-identifying codes in q-ary Lee space
- Extension of universal cycles for globally identifying colorings of cycles
- Links Between Discriminating and Identifying Codes in the Binary Hamming Space
- On codes identifying sets of vertices in Hamming spaces
- On Iiro Honkala's contributions to identifying codes
- Optimal local identifying and local locating-dominating codes
- Linear and group identifying codes in Hamming graphs
- Identifying codes in vertex-transitive graphs and strongly regular graphs
- Improved bounds on identifying codes in binary Hamming spaces
- New identifying codes in the binary Hamming space
This page was built for publication: New bounds on binary identifying codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q947104)
