Constructing good covering codes for applications in steganography
Document Type
Conference Proceeding
Publication Date
2008
Department
Department of Mathematical Sciences
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.
Publication Title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISBN
978-3-540-69019-1
Recommended Citation
Bierbrauer, J.,
&
Fridrich, J.
(2008).
Constructing good covering codes for applications in steganography.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),
4920 LNCS, 1-22.
http://doi.org/10.1007/978-3-540-69019-1_1
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/4163