Product perfect codes and steganography

Rifà-Pous, Helena; Rifà, Josep

doi:10.1016/j.dsp.2008.11.005

Cited by 27 publications

(27 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As proved in [7], the performance one can obtain with this method is better than the one obtained by just using the conventional F 5 algorithm on the corresponding codes with the same average distortion. We refer to [7] for further details on this method. Now, in this paper we will proceed with a generalization of the above procedure, by taking the product of more than two q-ary Hamming codes.…”

Section: Product Of Perfect Codes and Steganographymentioning

confidence: 86%

Product perfect Z<inf>2</inf> Z<inf>4</inf>-linear codes in steganography

Rifà

Ronquillo

2010

2010 International Symposium on Information Theory &Amp; Its Applications

View full text Add to dashboard Cite

Product perfect codes have been proven to enhance the performance of the F 5 steganographic method, whereas perfect Z2Z4-linear codes have been recently introduced as an efficient way to embed data, conforming to the ±1-steganography.In this paper, we present two steganographic methods. On the one hand, a generalization of product perfect codes is made. On the other hand, this generalization is applied to perfect Z2Z4linear codes. Finally, the performance of the proposed methods is evaluated and compared with those of the aforementioned schemes.

show abstract

Section: Product Of Perfect Codes and Steganographymentioning

confidence: 86%

Product perfect Z<inf>2</inf> Z<inf>4</inf>-linear codes in steganography

Rifà

Ronquillo

2010

2010 International Symposium on Information Theory &Amp; Its Applications

View full text Add to dashboard Cite

show abstract

“…The idea of product code-based data hiding was introduced in [5][6][7][8]. Basically, it can be considered as an extension of the previous works [1 -4] by taking a cover matrix block, not a cover sequence, for embedding on each time.…”

Section: Introductionmentioning

confidence: 99%

“…Although, the embedding concepts for both the 1-D and 2-D linear code-based data hiding schemes are similar in respectively adopting the technique of 1-D syndrome coding and 2-D syndrome coding, the embedding efficiency of the latter is much higher. However, due to the tremendous computational complexity in finding a coset leader [9,10] of a 2-D linear code, only suboptimal approaches with moderate computational complexity were presented in the literature [5][6][7][8]11,12]. In [5][6][7][8]12], the authors still utilized the 1-D toggle syndrome coding technique to solve the product code-based data hiding problem, whereas the authors of [11] directly utilized the concept of the 2-D toggle syndrome and proposed a sub-optimal approach with better embedding efficiency and low computational complexity.…”

Section: Introductionmentioning

confidence: 99%

An Improved Product Code-Based Data Hiding Scheme

Zhang

Huang

2018

Applied Sciences

View full text Add to dashboard Cite

This paper explores the data hiding schemes which are based on the principle of matrix embedding. Under the same embedding rate, the efficiency of each data hiding scheme is evaluated by the metric of average embedding efficiency. In the literature, both the row-column embedding and the weight approximation embedding algorithms are sub-optimal solutions for the product code-based data hiding problem. For the former, it is still based on the concept of one-dimensional (1-D) toggle syndrome, and the concept of two-dimensional (2-D) toggle syndrome is directly adopted for the latter one. Data hiding with multiple embedding channels is the practice of hiding messages into hidden media many times. Here, two multi-channel embedding-based data hiding techniques—one is the 1-D toggle syndrome-based embedding scheme (1DTS-1), and the other is the improved weight approximation-based embedding scheme (2DTS-1), are presented. In the former, the proposed one-off decision technique is used to determine the locations of the required modification bits, and the amount of modification will be reduced through utilizing the characteristics of the linear code. With the technique of the former, in the latter, the amount of modification bits can be further reduced because that a toggle array with better structure is generated, which is more suitable for being assigned as the initial toggle array while applying the weight approximation approach. The experimental results show our proposed hybrid 1-D/2-D toggle syndrome-based embedding scheme (2DTS-1) has increased the embedding efficiency by 0.1149 when compared to the weight approximation embedding algorithm. Further, the embedding efficiency of the latter one can be further and significantly enhanced through the Hamming+1 technique.

show abstract

“…The smaller size of the intersected area, the larger number of possible joint solutions. Similar approach has been tested for Hamming code in [23].…”

Section: Introductionmentioning

confidence: 99%

Modified BCH data hiding scheme for JPEG steganography

Sachnev

Kim

2012

EURASIP J. Adv. Signal Process.

View full text Add to dashboard Cite

In this article, a new Bose-Chaudhuri-Hochquenghem (BCH)-based data hiding scheme for JPEG steganography is presented. Traditional data hiding approaches hide data into each block, where all the blocks are not overlapping each other. However, in the proposed method, two consecutive blocks can be overlapped to form a combined block which is larger than a single block, but smaller than two consecutive nonoverlapping blocks in size. In order to embed more amounts of data into the combined block than a single block, the BCH-based data hiding scheme has to be redesigned. In this article, we propose a way to get a joint solution for hiding data into two blocks with intersected coefficients such that any modification of the intersected area does not affect the data hiding process into both blocks. Due to hiding more amounts of data into the intersected area, embedding capacity is increased. On the other hand, the nonzero DCT coefficient stream is modified to achieve better steganalysis and to reduce the distortion impact after data hiding. This approach carefully inserts or removes 1 or -1 coefficients into or from the DCT coefficient stream according to the rule proposed in this article. Experimental results show that the proposed algorithms work well and their performance is significant.

show abstract

Product perfect codes and steganography

Abstract: 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.

Cited by 27 publications

References 7 publications

Product perfect Z<inf>2</inf> Z<inf>4</inf>-linear codes in steganography

Product perfect Z<inf>2</inf> Z<inf>4</inf>-linear codes in steganography

An Improved Product Code-Based Data Hiding Scheme

Modified BCH data hiding scheme for JPEG steganography

Contact Info

Product

Resources

About