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 Nov 26 |
Fingerprint
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
Cite this
An efficient embedder for BCH coding for steganography. / Zhang, Rongyue; Sachnev, Vasiliy; Botnan, Magnus Bakke; Kim, Hyong Joong; Heo, Jun.
In: IEEE Transactions on Information Theory, Vol. 58, No. 12, 6294443, 26.11.2012, p. 7272-7279.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - An efficient embedder for BCH coding for steganography
AU - Zhang, Rongyue
AU - Sachnev, Vasiliy
AU - Botnan, Magnus Bakke
AU - Kim, Hyong Joong
AU - Heo, Jun
PY - 2012/11/26
Y1 - 2012/11/26
N2 - 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.
AB - 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.
KW - BCH coding
KW - data hiding
KW - error correcting code (ECC)
KW - steganography
KW - syndrome coding
UR - http://www.scopus.com/inward/record.url?scp=84869412854&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84869412854&partnerID=8YFLogxK
U2 - 10.1109/TIT.2012.2217072
DO - 10.1109/TIT.2012.2217072
M3 - Article
AN - SCOPUS:84869412854
VL - 58
SP - 7272
EP - 7279
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
SN - 0018-9448
IS - 12
M1 - 6294443
ER -