Constructing good covering codes for applications in steganography

Authors:
Jürgen Bierbrauer;Jessica Fridrich
Affiliations:
Department of Mathematical Sciences, Michigan Technological University, Houghton, MI;Department of Electrical and Computer Engineering, Binghamton University, Binghamton, NY
Venue:
Transactions on data hiding and multimedia security III
Year:
2008

Citing 13
Cited 16

A coloring problem in Hamming spaces

European Journal of Combinatorics
New Constructions of Covering Codes

Designs, Codes and Cryptography
Quaternary Codes

Quaternary Codes
F5-A Steganographic Algorithm

IHW '01 Proceedings of the 4th International Workshop on Information Hiding
Minimal 1-saturating sets and complete caps in binary projective spaces

Journal of Combinatorial Theory Series A
Defending against statistical steganalysis

SSYM'01 Proceedings of the 10th conference on USENIX Security Symposium - Volume 10
Feature-Based steganalysis for JPEG images and its implications for future design of steganographic schemes

IH'04 Proceedings of the 6th international conference on Information Hiding
Efficient wet paper codes

IH'05 Proceedings of the 7th international conference on Information Hiding
A general framework for structural steganalysis of LSB replacement

IH'05 Proceedings of the 7th international conference on Information Hiding
New covering codes from an ADS-like construction

IEEE Transactions on Information Theory
Quasi-perfect codes with small distance

IEEE Transactions on Information Theory
Locally optimal (nonshortening) linear covering codes and minimal saturating sets in projective spaces

IEEE Transactions on Information Theory
Nordstrom--Robinson code and A7-geometry

Finite Fields and Their Applications

Maximizing Steganographic Embedding Efficiency by Combining Hamming Codes and Wet Paper Codes

Information Hiding
Linear codes for high payload steganography

Discrete Applied Mathematics
How Reed-Solomon codes can improve steganographic schemes

EURASIP Journal on Information Security - Special issue on secure steganography in multimedia content
Asymptotic behavior of the ZZW embedding construction

IEEE Transactions on Information Forensics and Security
Generalization of the ZZW embedding construction for steganography

IEEE Transactions on Information Forensics and Security
Constructing specific matrix for efficient matrix embedding

ICME'09 Proceedings of the 2009 IEEE international conference on Multimedia and Expo
Improving embedding efficiency by incorporating SDCS and WPC

ICME'09 Proceedings of the 2009 IEEE international conference on Multimedia and Expo
Hybrid wet paper coding mechanism for steganography employing n-indicator and fuzzy edge detector

Digital Signal Processing
Improving embedding efficiency via matrix embedding: a case study

ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Near-optimal codes for information embedding in gray-scale signals

IEEE Transactions on Information Theory
Generalization and analysis of the paper folding method for steganography

IEEE Transactions on Information Forensics and Security
An efficient high payload ±1 data embedding scheme

Multimedia Tools and Applications
Ensuring message embedding in wet paper steganography

IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
A new data hiding scheme for small blocks of twelve pixels on binary images by module approach

ACIIDS'13 Proceedings of the 5th Asian conference on Intelligent Information and Database Systems - Volume Part I
A steganalysis by adjacency pixel bits structure

Computers and Electrical Engineering
Interpolation of steganographic schemes

Signal Processing

Quantified Score

Hi-index	0.06

Visualization

Abstract

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.