An efficient embedder for BCH coding for steganography

Rongyue Zhang; Vasiliy Sachnev; Magnus Bakke Botnan; Hyoung Joong Kim; Jun Heo

doi:10.1109/TIT.2012.2217072

An efficient embedder for BCH coding for steganography

Rongyue Zhang, Vasiliy Sachnev, Magnus Bakke Botnan, Hyoung Joong Kim, Jun Heo

Research output: Contribution to journal › Article › peer-review

35 Citations (Scopus)

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	https://doi.org/10.1109/TIT.2012.2217072
Publication status	Published - 2012

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

Access to Document

10.1109/TIT.2012.2217072

Cite this

@article{f46c9df929ba4a0884ffcf3fd0a99356,

title = "An efficient embedder for BCH coding for steganography",

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.",

keywords = "BCH coding, data hiding, error correcting code (ECC), steganography, syndrome coding",

author = "Rongyue Zhang and Vasiliy Sachnev and Botnan, {Magnus Bakke} and Kim, {Hyoung Joong} and Jun Heo",

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.",

year = "2012",

doi = "10.1109/TIT.2012.2217072",

language = "English",

volume = "58",

pages = "7272--7279",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "12",

}

TY - JOUR

T1 - An efficient embedder for BCH coding for steganography

AU - Zhang, Rongyue

AU - Sachnev, Vasiliy

AU - Botnan, Magnus Bakke

AU - Kim, Hyoung Joong

AU - Heo, Jun

N1 - 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.

PY - 2012

Y1 - 2012

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 -

An efficient embedder for BCH coding for steganography

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this