Abstract
This paper presents an improved data hiding technique based on BCH (n,k,t) coding. The proposed embedder hides data into a block of input data by modifying some coefficients in the block in order to null the syndrome. The proposed embedder can hide data with less computational time and less storage capacity compared to the existing methods. The complexity of the proposed method is linear while that of other methods are exponential for any block size n. Thus, it is easy to extend this method to a large n. The BCH syndrome coding for steganography is now viable ascribed to the reduced complexity and its simplicity of the proposed embedder.
Original language | English |
---|---|
Article number | 6294443 |
Pages (from-to) | 7272-7279 |
Number of pages | 8 |
Journal | IEEE Transactions on Information Theory |
Volume | 58 |
Issue number | 12 |
DOIs | |
Publication status | Published - 2012 |
Bibliographical note
Funding Information:Manuscript received August 07, 2009; revised May 29, 2012; accepted June 11, 2012. Date of publication September 04, 2012; date of current version November 14, 2012. This work was supported in part by the Catholic University of Korea, in part by the National Research Foundation of Korea under Grants 2011-0013695 and 2012015587, in part by 3DLife, in part by the Ministry of Culture, Sport, and Tourism, and in part by , Korea University.
Keywords
- BCH coding
- data hiding
- error correcting code (ECC)
- steganography
- syndrome coding
ASJC Scopus subject areas
- Information Systems
- Computer Science Applications
- Library and Information Sciences