Journal of Applied Sciences ›› 2016, Vol. 34 ›› Issue (5): 575-584.doi: 10.3969/j.issn.0255-8297.2016.05.010

• Special Issue: Information Security of Multimedia Contents • Previous Articles     Next Articles

Plus-Minus One Modified Product Steganographic Coding Based on Extended Embeddable Columns

ZHANG Ling-yu1,2, ZHAO Xian-feng2   

  1. 1. School of Computer and Communication Engineering, Liaoning Shihua University, Fushun 113001, Liaoning Province, China;
    2. The State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing 100093, China
  • Received:2016-07-29 Revised:2016-08-16 Online:2016-09-30 Published:2016-09-30

Abstract:

In the existing product coding technique, secret data are embedded into rows and columns of a particular Hamming code matrix in a sequential fashion using the (n, k) linear block codes generated with a parity-check matrix H. The product code is a type of parallel concatenated block code that uses short codes to construct a long code. In decoding, a relatively simple iterative technique is used. This paper proposes a novel algorithm of ±1 modified product steganographic code (±1 MPSC) by expending some embeddable columns. Compared with the product perfect code (PPC), ±1 MPSC uses 2c-1-1 additional columns where c is the column number of the Hamming code matrix. It also uses a XOR data list constructed by LSB and second LSB of adjacent carrier elements to further reduce the number of flips to improve embedding efficiency. The theoretical analysis and experiments show that the embedding rate of the proposed method reaches 1.33 times that of PPC, and the total performance of D-E curve is improved nearly 2%.

Key words: expending embeddable columns, parallel concatenated block code, ±, 1 modified product steganographic code, perfect product code

CLC Number: