Coding at the sample level for data hiding: turbo and concatenated codes

  title={Coding at the sample level for data hiding: turbo and concatenated codes},
  author={F{\'e}lix Balado and Fernando P{\'e}rez-Gonz{\'a}lez},
  booktitle={IS\&T/SPIE Electronic Imaging},
The performance of data hiding techniques in still images may be greatly improved by means of coding. In previous approaches repetition coding was firstly used to obtain N identical Gaussian channels over which block and convolutional coding were used. But knowing that repetition coding can be improved we may turn our attention to coding forwardly at the sample level. Bounds for both hard and soft decision decoding performance are provided and the use of concatenated coding and turbo coding for… 

Increasing watermarking robustness using turbo codes

A watermarking system that uses the biorthogonal discrete wavelet transform, DWT and the message is encoded before embedding and the association of theDWT and duo-binary turbo codes is proposed.


The main results of this study are the development of novel audio watermarking algorithms, with the state-of-the-art performance and an acceptable increase in computational complexity.

Digital image data hiding using side information

La robustez es una cuestion clave para muchas aplicaciones potenciales de las tecnologias de ocultacion de datos (watermarking). La propuesta de usar informacion lateral en el codificador ha

Watermark detection based on the properties of error control codes

It is shown that it is not necessary to use a reference watermark for detection purposes if the watermark payload is encoded with an error control code, and one can put all the energy into the payload watermark and increase its robustness.

Limits of error correction coding in video watermarking

The paper discusses the limits of error correction coding for spread spectrum-based video watermarking and investigates several practical codes, such as turbo codes and BCH codes, and their performance compared to that of the ideal code of the same size.




A way to construct interleavers that significantly improve the performance of the turbo coding scheme at high SNR’s, i.e. lowers the error floor is presented.

Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1

A new class of convolutional codes called turbo-codes, whose performances in terms of bit error rate (BER) are close to the Shannon limit, is discussed. The turbo-code encoder is built using a

A search for good convolutional codes to be used in the construction of turbo codes

Tables of the "best" recursive systematic convolutional encoders found are presented for various rates, together with the average bit-error probability performances of some turbo codes using them.

'Turbo' coding for deep space applications

  • J. D. Andersen
  • Physics
    Proceedings of 1995 IEEE International Symposium on Information Theory
  • 1995
The performance of the 'turbo' coding scheme is measured and an error floor is discovered, and for low data rates a realizable system operating at E/sub b//N/sub 0/ below 0.2 dB is presented.

Modulation and coding for satellite and space communications

To support long-constraint-length convolutional code, a VLSI maximum-likelihood decoder, utilizing parallel processing techniques, which is being developed to decode Convolutional codes of constraint length 15 and a code rate as low as 1/6 is discussed.

Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)

The general problem of estimating the a posteriori probabilities of the states and transitions of a Markov source observed through a discrete memoryless channel is considered and an optimal decoding algorithm is derived.

A Turbo Code Tutorial

The treatment is intended to be a launching point for further study in the turbo codes and the associated algorithms and to provide su±cient information for the design of computer simulations.

Performance analysis of a 2-D-multipulse amplitude modulation scheme for data hiding and watermarking of still images

The main contribution of this paper is the introduction of an analytical point of view to the estimation of performance measurements in a watermarking scheme for copyright protection of still images.

DCT-domain watermarking techniques for still images: detector performance analysis and a new structure

Analysis of a spread-spectrum-like discrete cosine transform (DCT) domain watermarking technique for copyright protection of still digital images is analyzed and analytical expressions for performance measures are derived and contrasted with experimental results.