Optimal \((2, n )\) visual cryptographic schemes (Q851754): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:42, 30 January 2024
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
22 November 2006
0 references
Pixel expansion
0 references
Regular graph design
0 references
Relative contrast
0 references
Share
0 references
