Sciweavers

44 search results - page 2 / 9
» Constructing Good Covering Codes for Applications in Stegano...
Sort
View
IH
2007
Springer
13 years 11 months ago
YASS: Yet Another Steganographic Scheme That Resists Blind Steganalysis
Abstract. A new, simple, approach for active steganography is proposed in this paper that can successfully resist recent blind steganalysis methods, in addition to surviving distor...
Kaushal Solanki, Anindya Sarkar, B. S. Manjunath
MMSEC
2006
ACM
129views Multimedia» more  MMSEC 2006»
13 years 11 months ago
WLAN steganography: a first practical review
Two different approaches for constructing a steganographic channel in an IEEE 802.11 (WLAN) network are introduced in this paper. First test results on the reliability, undetectab...
Christian Krätzer, Jana Dittmann, Andreas Lan...
IH
2005
Springer
13 years 10 months ago
Efficient Wet Paper Codes
Abstract. Wet paper codes were proposed as a tool for constructing steganographic schemes with an arbitrary selection channel that is not shared between the sender and the recipien...
Jessica J. Fridrich, Miroslav Goljan, David Soukal
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
14 years 5 months ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...
CORR
2008
Springer
106views Education» more  CORR 2008»
13 years 5 months ago
Construction of Near-Optimum Burst Erasure Correcting Low-Density Parity-Check Codes
In this paper, a simple and effective tool for the design of low-density parity-check (LDPC) codes for iterative correction of bursts of erasures is presented. The design method co...
Enrico Paolini, Marco Chiani