Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

39

TDHMS
2008

favoriteEmaildiscussreport

158views Security Privacy» more TDHMS 2008»

Constructing Good Covering Codes for Applications in Steganography

13 years 10 months ago

Constructing Good Covering Codes for Applications in Steganography

Download www.ws.binghamton.edu

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 constructed using the blockwise direct sum of factorizations. We show that non-linear constructions offer better performance compared to simple linear covering codes currently used by steganographers. Implementation details are given for a selected code family.

Jürgen Bierbrauer, Jessica J. Fridrich

Real-time Traffic

Blockwise Direct Sum | Embedding | Security Privacy | Steganographic Schemes | TDHMS 2008 |

claim paper

Related Content

» Using Digital Images to spread Executable Code on Internet

» Perfectly Secure Steganography Capacity Error Exponents and Code Constructions

» Minimizing embedding impact in steganography using trelliscoded quantization

» Identifying Codes and Covering Problems

» YASS Yet Another Steganographic Scheme That Resists Blind Steganalysis

» WLAN steganography a first practical review

» Efficient Wet Paper Codes

» The minimum consistent subset cover problem and its applications in data mining

» Construction of NearOptimum Burst Erasure Correcting LowDensity ParityCheck Codes

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2008
Where	TDHMS
Authors	Jürgen Bierbrauer, Jessica J. Fridrich

Comments (0)