Steganographic Codes -- a New Problem of Coding Theory

Computer Science – Cryptography and Security

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

7 pages with 1 figure

Scientific paper

To study how to design steganographic algorithm more efficiently, a new coding problem -- steganographic codes (abbreviated stego-codes) -- is presented in this paper. The stego-codes are defined over the field with $q(q\ge2)$ elements. Firstly a method of constructing linear stego-codes is proposed by using the direct sum of vector subspaces. And then the problem of linear stego-codes is converted to an algebraic problem by introducing the concept of $t$th dimension of vector space. And some bounds on the length of stego-codes are obtained, from which the maximum length embeddable (MLE) code is brought up. It is shown that there is a corresponding relation between MLE codes and perfect error-correcting codes. Furthermore the classification of all MLE codes and a lower bound on the number of binary MLE codes are obtained based on the corresponding results on perfect codes. Finally hiding redundancy is defined to value the performance of stego-codes.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Steganographic Codes -- a New Problem of Coding Theory does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Steganographic Codes -- a New Problem of Coding Theory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Steganographic Codes -- a New Problem of Coding Theory will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-117371

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.