Encoding watermark numbers as reducible permutation graphs using self-inverting permutations (Q1801057)
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 6966407
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Encoding watermark numbers as reducible permutation graphs using self-inverting permutations |
scientific article; zbMATH DE number 6966407 |
Statements
Encoding watermark numbers as reducible permutation graphs using self-inverting permutations (English)
0 references
26 October 2018
0 references
watermarking
0 references
self-inverting permutations
0 references
reducible permutation graphs
0 references
polynomial codec algorithms
0 references
structural properties
0 references
evaluation
0 references
0.8445949
0 references
