On identifying codes in binary Hamming spaces
From MaRDI portal
Publication:696908
DOI10.1006/JCTA.2002.3263zbMATH Open1005.94030OpenAlexW2084325182MaRDI QIDQ696908FDOQ696908
Antoine Lobstein, Iiro 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
Recommendations
Other types of codes (94B60) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the complexity of the identification problem in Hamming spaces
- Title not available (Why is that?)
- Title not available (Why is that?)
- On a new class of codes for identifying vertices in graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sequences of optimal identifying codes
- On codes identifying sets of vertices in Hamming spaces
- Two families of optimal identifying codes in binary Hamming spaces
- Title not available (Why is that?)
- Good coverings of Hamming spaces with spheres
- Title not available (Why is that?)
- Bounds on identifying codes
- On strongly identifying codes
- The complexity of computing the covering radius of a code
- On tilings of the binary vector space
- Optimal codes for strong identification
- Families of optimal codes for strong identification
- Unit sphere packings and coverings of the Hamming space
- Linear codes with covering radius 2 and other new covering codes
- A nonconstructive upper bound on covering radius
- Do most binary linear codes achieve the Goblick bound on the covering radius? (Corresp.)
- Balancing sets of vectors
Cited In (29)
- Title not available (Why is that?)
- More results on the complexity of identifying problems in graphs
- On binary linear \(r\)-identifying codes
- Title not available (Why is that?)
- New identifying codes in the binary Hamming space
- A family of optimal identifying codes in \(\mathbb Z^2\)
- On the size of identifying codes in binary hypercubes
- On the complexity of the identification problem in Hamming spaces
- On two variations of identifying codes
- On identification in the triangular grid
- On Iiro Honkala's contributions to identifying codes
- New bounds on binary identifying codes
- On \(t\)-revealing codes in binary Hamming spaces
- Identifying codes in the direct product of a complete graph and some special graphs
- Adaptive identification in graphs
- Identifying codes of the direct product of two cliques
- Identifying codes of corona product graphs
- Locating-Domination and Identification
- Optimal identifying codes of two families of Cayley graphs
- Monotonicity of the minimum cardinality of an identifying code in the hypercube
- Sphere coverings and identifying codes
- New results of identifying codes in product graphs
- Locating and identifying codes in dihedral graphs
- Locating and identifying codes in circulant networks
- On minimum identifying codes in some Cartesian product graphs
- Improved upper bounds for identifying codes in \(n\)-dimensional \(q\)-ary cubes
- On identifying codes that are robust against edge changes
- Links Between Discriminating and Identifying Codes in the Binary Hamming Space
- Identifying codes in vertex-transitive graphs and strongly regular graphs
This page was built for publication: On identifying codes in binary Hamming spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q696908)
