On identifying codes in binary Hamming spaces
From MaRDI portal
Publication:696908
DOI10.1006/jcta.2002.3263zbMath1005.94030OpenAlexW2084325182MaRDI QIDQ696908
Antoine C. Lobstein, Iiro S. Honkala
Publication date: 12 September 2002
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcta.2002.3263
Other types of codes (94B60) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
Related Items (23)
More results on the complexity of identifying problems in graphs ⋮ On identifying codes that are robust against edge changes ⋮ A family of optimal identifying codes in \(\mathbb Z^2\) ⋮ Optimal identifying codes of two families of Cayley graphs ⋮ On minimum identifying codes in some Cartesian product graphs ⋮ Identifying codes in vertex-transitive graphs and strongly regular graphs ⋮ Improved upper bounds for identifying codes in \(n\)-dimensional \(q\)-ary cubes ⋮ Sphere coverings and identifying codes ⋮ Identifying codes of the direct product of two cliques ⋮ Locating and identifying codes in circulant networks ⋮ Identifying codes in the direct product of a complete graph and some special graphs ⋮ Identifying codes of corona product graphs ⋮ New results of identifying codes in product graphs ⋮ Adaptive identification in graphs ⋮ New identifying codes in the binary Hamming space ⋮ On binary linear \(r\)-identifying codes ⋮ Monotonicity of the minimum cardinality of an identifying code in the hypercube ⋮ On \(t\)-revealing codes in binary Hamming spaces ⋮ On two variations of identifying codes ⋮ Locating-Domination and Identification ⋮ Locating and identifying codes in dihedral graphs ⋮ On the size of identifying codes in binary hypercubes ⋮ On identification in the triangular grid
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Good coverings of Hamming spaces with spheres
- On tilings of the binary vector space
- On the complexity of the identification problem in Hamming spaces
- Optimal codes for strong identification
- Families of optimal codes for strong identification
- On strongly identifying codes
- Unit sphere packings and coverings of the Hamming space
- Linear codes with covering radius 2 and other new covering codes
- The complexity of computing the covering radius of a code
- A nonconstructive upper bound on covering radius
- Do most binary linear codes achieve the Goblick bound on the covering radius? (Corresp.)
- On a new class of codes for identifying vertices in graphs
- Sequences of optimal identifying codes
- Two families of optimal identifying codes in binary Hamming spaces
- Balancing sets of vectors
- On codes identifying sets of vertices in Hamming spaces
- Bounds on identifying codes
This page was built for publication: On identifying codes in binary Hamming spaces
