Optimal \((2, n )\) visual cryptographic schemes (Q851754)

From MaRDI portal
Revision as of 09:36, 25 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Optimal \((2, n )\) visual cryptographic schemes
scientific article

    Statements

    Optimal \((2, n )\) visual cryptographic schemes (English)
    0 references
    0 references
    0 references
    22 November 2006
    0 references
    Pixel expansion
    0 references
    Regular graph design
    0 references
    Relative contrast
    0 references
    Share
    0 references

    Identifiers