Constructing Good Covering Codes for Applications in Steganography

  • Jürgen Bierbrauer
  • Jessica Fridrich

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Jürgen Bierbrauer
    • 1
  • Jessica Fridrich
    • 2
  1. 1.Department of Mathematical SciencesMichigan Technological UniversityHOUGHTON (MI)USA
  2. 2.Department of Electrical and Computer EngineeringBinghamton UniversityBINGHAMTON (NY) 

Personalised recommendations