We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
A Modified Product Code Over Z<sub>4</sub>; in Steganography with Large Embedding Rate.
- Authors
Lingyu Zhang; Deyuan Chen
- Abstract
The way of combination of Product Perfect Codes (PPCs) is based on the theory of short codes constructing long codes. PPCs have larger embedding rate than Hamming codes by expending embedding columns in a coding block, and they have been proven to enhance the performance of the steganographic F5 method. In this paper, the proposed modified product codes called MPCs are introduced as an efficient way to embed more data than PPCs by increasing 2r2-1-r2 embedding columns. Unlike PPC, the generation of the check matrix H in MPC is random, and it is different from PPC. In addition a simple solving way of the linear algebraic equations is applied to figure out the problem of expending embedding columns or compensating cases. Furthermore, the MPCs over Z4 have been proposed to further enhance not only the performance but also the computation speed which reaches O(n1 + s). Finally, the proposed Z4-MPC intends to maximize the embedding rate with maintaining less distortion, and the performance surpasses the existing improved product perfect codes. The performance of large embedding rate should have the significance in the high-capacity of covert communication.
- Subjects
PRODUCT coding; CRYPTOGRAPHY; CODING theory; HAMMING codes; ALGEBRAIC equations
- Publication
KSII Transactions on Internet & Information Systems, 2016, Vol 10, Issue 7, p3353
- ISSN
1976-7277
- Publication type
Article
- DOI
10.3837/tiis.2016.07.027