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. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Bierbrauer, J., & Fridrich, J. (2008). Constructing good covering codes for applications in steganography. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4920 LNCS, pp. 1–22). https://doi.org/10.1007/978-3-540-69019-1_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
