Linear and group identifying codes in Hamming graphs
From MaRDI portal
Cites work
- An intrinsical description of group codes
- Application of optimal \(p\)-ary linear codes to alphabet-optimal locally repairable codes
- Bounds on identifying codes
- Group codes of dimension 2 and 3 are abelian
- Group codes over crystallographic point groups
- Group codes over non-abelian groups
- scientific article; zbMATH DE number 1024657 (Why is no real title available?)
- scientific article; zbMATH DE number 1436153 (Why is no real title available?)
- ID codes in Cartesian products of cliques
- Identifying codes in \(q\)-ary hypercubes
- Identifying codes of Cartesian product of two cliques of the same size
- Improved Upper Bounds on Binary Identifying Codes
- New bounds on binary identifying codes
- New examples of non-abelian group codes
- New identifying codes in the binary Hamming space
- On a conjecture regarding identification in Hamming graphs
- On a new class of codes for identifying vertices in graphs
- On a new class of identifying codes in graphs
- On binary linear \(r\)-identifying codes
- On regular and new types of codes for location-domination
- On the covering of vertices for fault diagnosis in hypercubes
- Optimal linear identifying codes
- Optimal ternary locally repairable codes
- The domination number of \(K_n^3\)
This page was built for publication: Linear and group identifying codes in Hamming graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7345674)
