scientific article; zbMATH DE number 5879500

zbMath1216.94063MaRDI QIDQ5393489

Jon-Lark Kim, Seog-Jin Kim

Publication date: 18 April 2011

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

fault toleranceparallel processingidentifying codes\(q\)-ary hypercubes

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Related Items (9)

On identifying codes in the Cartesian product of a path and a complete graph ⋮ Bounds on r-identifying codes in q-ary Lee space ⋮ Optimal identifying codes of two families of Cayley graphs ⋮ Improved upper bounds for identifying codes in \(n\)-dimensional \(q\)-ary cubes ⋮ Identifying codes in the direct product of a complete graph and some special graphs ⋮ Identifying codes of corona product graphs ⋮ r-Identifying codes in binary Hamming space, q-ary Lee space and incomplete hypercube ⋮ New results of identifying codes in product graphs ⋮ Constructions of \(r\)-identifying codes and \((r, \leq l)\)-identifying codes

This page was built for publication: