Bounds for the size of a minimal 1-perfect bitrade in a Hamming graph (Q5264765)

From MaRDI portal
Revision as of 13:20, 10 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6466120
Language Label Description Also known as
English
Bounds for the size of a minimal 1-perfect bitrade in a Hamming graph
scientific article; zbMATH DE number 6466120

    Statements

    Bounds for the size of a minimal 1-perfect bitrade in a Hamming graph (English)
    0 references
    27 July 2015
    0 references
    Hamming graph
    0 references
    Krawtchouk polynomial
    0 references
    Kravchuk polynomial
    0 references
    1-perfect bitrade
    0 references
    0 references
    0 references

    Identifiers