Product perfect codes and steganography

  • Authors:
  • H. Rifà-Pous;J. Rifà

  • Affiliations:
  • Department of Computer Science and Multimedia, Universitat Oberta de Catalunya, Rambla del Poblenou 156, 08018-Barcelona, Spain;Department of Information and Communications Engineering, Universitat Autònoma de Barcelona, 08193-Cerdanyola del Vallès, Barcelona, Spain

  • Venue:
  • Digital Signal Processing
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

A new coding technique to be used in steganography is evaluated. The performance of this new technique is computed and comparisons with the well-known theoretical upper bound, Hamming upper bound and basic LSB are established.