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

Rifà Coma, Josep

Rifà Pous, Helena

English

The Oberta in open access

A Coding Problem in Steganography&quot;. To appear in Designs, Codes and Cryptography. A preprint available at http://arxiv.org/abs/cs/0505072.

a, \A characterization of 1-perfect additive codes&quot;,

Constructing good covering codes for applications in steganography, Available at http://www.math.mtu.edu/jbierbra/

High Capacity Despite Better Steganalysis (F5 - A Steganographic Algorithm),

On steganographic embedding eciency&quot;,

Some notes on steganography,

Steganography and error-correcting codes&quot;,

Z4-linear Hadamard and extended perfect codes&quot;,

Product Perfect Codes and Steganography

Product Perfect Codes and Steganography

Abstract

Similar works

Full text

Available Versions

The Oberta in open access