Journal of Applied Sciences

• Articles • Previous Articles     Next Articles

Generalized Running Coding with Prime Base for Efficient Steganographic Embedding

ZHANG Xin-peng; WANG Shuo-zhong   

  1. School of Communication and Information Engineering, Shanghai University, Shanghai 200072, China
  • Received:2008-09-01 Revised:2008-10-05 Online:2009-01-25 Published:2009-01-25
  • Contact: ZHANG Xin-peng

Abstract: Steganographic coding such as the running coding described in a previous work can be used to improve embedding efficiency, thus enhance steganographic security. In this paper, we modify the original running coding
method and propose a generalized scheme with a prime base. With the generalized approach, each secret digit in a notational system using a prime base is represented by a series of cover values. Alteration to one cover value is used to embed several secret digits so that distortion is significantly reduced. The previous running coding is in effect a special case of the generalized scheme with a prime base p = 2, i.e., the binary system. Theoretical analysis indicates that the generalized running coding with p = 3 provides the best performance.

Key words: data hiding, steganography, running coding

CLC Number: