• Corpus ID: 12408951

Perfect Z2Z4-linear codes in Steganography

@article{RifPous2010PerfectZC,
  title={Perfect Z2Z4-linear codes in Steganography},
  author={Helena Rif{\`a}-Pous and Josep Rif{\`a} and Lorena Ronquillo},
  journal={ArXiv},
  year={2010},
  volume={abs/1002.0026}
}
Steganography is an information hiding application which aims to hide secret data imperceptibly into a commonly used media. Unfortunately, the theoretical hiding asymptotical capacity of steganographic systems is not attained by algorithms developed so far. In this paper, we describe a novel coding method based on Z2Z4-linear codes that conforms to +/-1-steganography, that is secret data is embedded into a cover message by distorting each symbol by one unit at most. This method solves some… 
A Novel Steganographic Protocol from Error-correcting Codes
TLDR
The proposed method consists of use the Majority logic decoding introduced in [5], for embedding the message in the cover image, the extraction function is always based on syndrome coding and an asymptoticly tight bound on the performance of embedding schemes is given.
A STEGANOGRAPHY SCHEMA AND ERROR-CORRECTING CODES
The idea of "Matrix encoding" was introduced in steganography by Crandall in 1998 [6]. The implementation was then proposed by Westfeld with steganography algorithm F5 [1]. The objective is to
Product perfect Z2 Z4-linear codes in steganography
  • J. Rifà, L. Ronquillo
  • Computer Science, Mathematics
    2010 International Symposium On Information Theory & Its Applications
  • 2010
TLDR
Two steganographic methods are presented: a generalization of product perfect codes is made and this generalization is applied to perfect Z2 Z4-linear codes.
Error correcting codes and their usage in steganography and watermarking
  • H. Kostadinov, N. Manev
  • Computer Science
    2015 38th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO)
  • 2015
TLDR
Two methods of information embedding in spatial domain are discussed: a matrix embedding by q-ary codes and a method based on pseudo-noise patterns and which explodes the erasure capability of error correcting codes.
Application des codes correcteurs d'erreurs en stéganographie
TLDR
This thesis deals with the construction and security of stego-sytems based on error correcting codes and proposed two schemes using efficient graph coloring method and LSB (least signi- ficant bit).
Steganographic algorithm based on error-correcting codes for gray scale images
  • M. Medeni, E. M. Souidi
  • Computer Science
    2010 5th International Symposium On I/V Communications and Mobile Network
  • 2010
TLDR
In this paper, a new construction of protocol steganography is considered, it is an extension of the error correcting code and Steganography construction introduced by the authors in [12].
A Novel Steganography Algorithm for Hiding Text in Image using Five Modulus Method
TLDR
This paper is to create a practical steganographic implementation to hide text inside grey scale images using Five Modulus Method which is very efficient to hide the data inside the image.
TEXT IN IMAGE STEGANOGRAPHY BASED ON A DYNAMIC NON-SEQUENTIAL LEAST SIGNIFICANT BIT TECHNIQUE IN GRAYSCALE AND RGB IMAGES
Information hiding is one of the considerable objects in secret communication. Steganography is a vital research area in recent years relating several applications. Image steganography is the mode of
Hiding Technique Using FMM , Visual Cryptography and Genetic Algorithm
The needs for steganography techniques to hiding secret message inside images have been arise. Image steganography is an emerging field of research for secure data hiding and transmission over
An Improved Product Code-Based Data Hiding Scheme
TLDR
The experimental results show the 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.
...
1
2
...

References

SHOWING 1-10 OF 11 REFERENCES
F5-A Steganographic Algorithm
TLDR
The newly developed algorithm F5 withstands visual and statistical attacks, yet it still offers a large steganographic capacity because it implements matrix encoding to improve the efficiency of embedding and reduces the number of necessary changes.
F5—A Steganographic Algorithm High Capacity Despite Better Steganalysis
TLDR
The newly developed algorithm F5 withstands visual and statistical attacks, yet it still of- fers a large steganographic capacity, and implements matrix encoding to improve the efficiency of embedding.
On Steganographic Embedding Efficiency
TLDR
It is demonstrated that for linear codes of fixed block length and dimension, the highest embedding efficiency is not necessarily achieved using codes with the smallest covering radius, but with increasing code length and fixed rate, the relative average distance to code and the relative covering radius coincide.
Constructing Good Covering Codes for Applications in Steganography
TLDR
Several familes of covering codes constructed using the blockwise direct sum of factorizations show that non-linear constructions offer better performance compared to simple linear covering codes currently used by steganographers.
Some Notes on Steganography
This essay presents some observations concerning low rate steganography in images where the amount of covert information is below one bit per pixel. This discussion is restricted to paletted images,
Data-Hiding Codes
TLDR
This tutorial paper reviews the theory and design of codes for hiding or embedding information in signals such as images, video, audio, graphics, and text and is illustrated with applications to the problem of hiding data in images.
Product perfect codes and steganography
TLDR
A new coding technique to be used in steganography is evaluated and comparisons with the well-known theoretical upper bound, Hamming upper bound and basic LSB are established.
A characterization of 1-perfect additive codes
TLDR
A full characterization of perfect single error-correcting codes, or 1 perfect codes, that are subgroups of F/sup n/ with a distance-compatible Abelian structure is given and it is proved that two such codes are different if they have different parameters.
Grid Colorings in Steganography
TLDR
A simple construction is used to prove that the d-dimensional grid graph Gd is rainbow for all d ges 1 and an important application of this result in steganography is discussed.
Lisoněk, “Grid colorings in steganography
  • IEEE Trans. on Information Theory,
  • 2007
...
1
2
...