.png){kind=icon}
Return
Wet paper codes with improved embedding efficiency
.png){kind=icon}
OA
AI
DOI：10.1109/TIFS.2005.863487.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Wet paper codes were previously proposed as a tool for construction of steganographic schemes with arbitrary (nonshared) selection channels. In this paper, we propose a new approach to wet paper codes using random linear codes of small codimension that at the same time improves the embedding efficiency (number of random message bits embedded per embedding change). Practical algorithms are given and their performance is evaluated experimentally and compared to theoretically achievable bounds. An approximate formula for the embedding efficiency of the proposed scheme is derived. The proposed coding method can be modularly combined with most steganographic schemes to improve their security.
Keywords:
covering codes
embedding efficiency
matrix embedding
selection channel
steganography
wet paper codes
Journal
IF:
8
Papers:
5.3K
Citations:
2.3W
Organization
No organization information available
Cited Papers
ShareSave
ShareSaveShareSavePhylogenetic Relationships of Monocots Based on the Highly Informative Plastid Gene ndhF.png)
AlisoOAAI
AlisoIF0
OAAIShareSaveArbitrary resolutions, missing entries and the problem of zero-length branches in parsimony analysis
IF0
PREAI
ShareSaveShareSave no more
no more