29 April 2002 Turbo-coded trellis-based constructions for data hiding
Author Affiliations +
Abstract
It has recently been discovered that many current applications such as data hiding and watermarking can be posed as the problem of channel coding with side information. As a result there has been considerable interest in designing codes to try and attain the theoretical capacity of the problem. It was shown by Pradhan et. al that in order to achieve capacity, a powerful channel codebook that partitions into a powerful source codebook should be chosen. The data to be embedded will index the source codebook partition. The constructions that exist in the literature, however, are typically based on powerful channel codebooks and weak source codebook partitions and hence remain at a considerable gap to capacity. In this paper, we present several methods of construction that are based on a powerful channel codebook (i.e. turbo codes) and powerful source codebook partitions (i.e., trellis coded quantization) to try and bridge the gap to capacity. For the Gaussian channel coding with side information (CCSI) problem at a transmission rate of 1 bit/channel use, our proposed approach comes within 2.72 dB of the information-theoretic capacity.
© (2002) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jim C. Chou, Jim C. Chou, Kannan Ramchandran, Kannan Ramchandran, S. Sandeep Pradhan, S. Sandeep Pradhan, } "Turbo-coded trellis-based constructions for data hiding", Proc. SPIE 4675, Security and Watermarking of Multimedia Contents IV, (29 April 2002); doi: 10.1117/12.465298; https://doi.org/10.1117/12.465298
PROCEEDINGS
10 PAGES


SHARE
Back to Top