Product perfect codes and steganography

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.