Transactions on Data Hiding and Multimedia Security III

Volume 4920 of the series Lecture Notes in Computer Science pp 1-22

Constructing Good Covering Codes for Applications in Steganography

  • Jürgen BierbrauerAffiliated withDepartment of Mathematical Sciences, Michigan Technological University
  • , Jessica FridrichAffiliated withDepartment of Electrical and Computer Engineering, Binghamton University

* Final gross prices may vary according to local VAT.

Get Access


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.