Constructing good covering codes for applications in steganography

Document Type

Conference Proceeding

Publication Date



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. © 2008 Springer-Verlag Berlin Heidelberg.

Publication Title

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)