Sciweavers

44 search results - page 1 / 9
» Constructing Good Covering Codes for Applications in Stegano...
Sort
View
TDHMS
2008
13 years 4 months ago
Constructing Good Covering Codes for Applications in Steganography
Application of covering codes to data embedding improves embedding efficiency and security of steganographic schemes. In this paper, we describe several familes of covering codes c...
Jürgen Bierbrauer, Jessica J. Fridrich
IICS
2010
Springer
13 years 8 months ago
Using Digital Images to spread Executable Code on Internet
. Steganography is defined as covered writing and it has been used to achieve confidentiality. Most of research in this domain has focused in just sending plain data. In this paper...
Roberto Gómez, Gabriel Ramírez
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 4 months ago
Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions
An analysis of steganographic systems subject to the following perfect undetectability condition is presented in this paper. Following embedding of the message into the covertext,...
Ying Wang, Pierre Moulin
MEDIAFORENSICS
2010
13 years 6 months ago
Minimizing embedding impact in steganography using trellis-coded quantization
In this paper, we propose a practical approach to minimizing embedding impact in steganography based on syndrome coding and trellis-coded quantization and contrast its performance...
Tomás Filler, Jan Judas, Jessica J. Fridric...
TIT
2008
122views more  TIT 2008»
13 years 4 months ago
Identifying Codes and Covering Problems
The identifying code problem for a given graph involves finding a minimum set of vertices whose neighborhoods uniquely overlap at any given graph vertex. Initially introduced in 1...
Moshe Laifenfeld, Ari Trachtenberg