Improved upper bounds for identifying codes in \(n\)-dimensional \(q\)-ary cubes (Q2186954): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 02:27, 2 February 2024

scientific article
Language Label Description Also known as
English
Improved upper bounds for identifying codes in \(n\)-dimensional \(q\)-ary cubes
scientific article

    Statements

    Improved upper bounds for identifying codes in \(n\)-dimensional \(q\)-ary cubes (English)
    0 references
    0 references
    0 references
    10 June 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    identifying code
    0 references
    Cartesian product
    0 references
    cycle
    0 references
    path
    0 references