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

From MaRDI portal
Revision as of 10:41, 1 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    identifying code
    0 references
    Cartesian product
    0 references
    cycle
    0 references
    path
    0 references

    Identifiers