Identifying codes in q-ary hypercubes
From MaRDI portal
Recommendations
- Improved upper bounds for identifying codes in n-dimensional q-ary cubes
- \(r\)-identifying codes in binary Hamming space, \(q\)-ary Lee space and incomplete hypercube
- Bounds on r-identifying codes in q-ary Lee space
- On the size of identifying codes in binary hypercubes
- New identifying codes in the binary Hamming space
Cited in
(16)- On the size of identifying codes in binary hypercubes
- Identifying codes in the direct product of a complete graph and some special graphs
- On a conjecture regarding identification in Hamming graphs
- Binary codes from \(m\)-ary \(n\)-cubes \(Q^m_n\)
- Optimal identifying codes of two families of Cayley graphs
- Improved upper bounds for identifying codes in n-dimensional q-ary cubes
- New results of identifying codes in product graphs
- Constructions of r-identifying codes and (r, l)-identifying codes
- Identifying codes of corona product graphs
- Monotonicity of the minimum cardinality of an identifying code in the hypercube
- On identifying codes in the Cartesian product of a path and a complete graph
- \(r\)-identifying codes in binary Hamming space, \(q\)-ary Lee space and incomplete hypercube
- Bounds on r-identifying codes in q-ary Lee space
- Identifying codes in the direct product of a path and a complete graph
- Linear and group identifying codes in Hamming graphs
- Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs
This page was built for publication: Identifying codes in \(q\)-ary hypercubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5393489)
