Optimal \((2, n )\) visual cryptographic schemes (Q851754)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5075349
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal \((2, n )\) visual cryptographic schemes |
scientific article; zbMATH DE number 5075349 |
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
0.9641178
0 references
0 references
0.9122495
0 references
0.90922344
0 references
0.90094125
0 references
0.89983463
0 references
0.89608437
0 references
0.89505595
0 references
0.89431983
0 references
