5 citations · 11 across the 7 of their papers we have counts for
8 papers
Improving success probability and embedding efficiency in code based steganography
Morgan Barbier, Carlos Munuera
For stegoschemes arising from error correcting codes, embedding depends on a decoding map for the corresponding code. As decoding maps are usually not complete, embedding can fail.…
On the decoding of quasi-BCH codes
Morgan Barbier, Clément Pernet, Guillaume Quintin
In this paper we investigate the structure of quasi-BCH codes. In the first part of this paper we show that quasi-BCH codes can be derived from Reed-Solomon codes over square matri…
Re-encoding reformulation and application to Welch-Berlekamp algorithm
Morgan Barbier
The main decoding algorithms for Reed-Solomon codes are based on a bivariate interpolation step, which is expensive in time complexity. Lot of interpolation methods were proposed i…
Ensuring message embedding in wet paper steganography
Daniel Augot, Morgan Barbier, Caroline Fontaine
Syndrome coding has been proposed by Crandall in 1998 as a method to stealthily embed a message in a cover-medium through the use of bounded decoding. In 2005, Fridrich et al. intr…
On Quasi-Cyclic Codes as a Generalization of Cyclic Codes
Morgan Barbier, Christophe Chabot, Guillaume Quintin
In this article we see quasi-cyclic codes as block cyclic codes. We generalize some properties of cyclic codes to quasi-cyclic ones such as generator polynomials and ideals. Indeed…
Wet paper codes and the dual distance in steganography
Carlos Munuera, Morgan Barbier
In 1998 Crandall introduced a method based on coding theory to secretly embed a message in a digital support such as an image. Later Fridrich et al. improved this method to minimiz…