.png){kind=icon}
返回
Wet paper codes with improved embedding efficiency
.png){kind=icon}
OA
AI
DOI：10.1109/TIFS.2005.863487.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
covering codes
embedding efficiency
matrix embedding
selection channel
steganography
wet paper codes
期刊
IF:
8
论文数:
5.3K
被引数:
2.3W
机构
暂无机构信息
引用论文
分享收藏
Phylogenetic Relationships of Monocots Based on the Highly Informative Plastid Gene ndhF.png)
AlisoOAAI
AlisoIF0
OAAI分享收藏Arbitrary resolutions, missing entries and the problem of zero-length branches in parsimony analysis
IF0
PREAI
分享收藏 没有更多内容
没有更多内容