3 citations · 3 across the 3 of their papers we have counts for
Showing cs.ITShow all
3 papers · 1 filter
cs.IT2013
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.…
cs.IT2012★ 3 cited
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…
cs.IT2010
New Set of Codes for the Maximum-Likelihood Decoding Problem
Morgan Barbier
The maximum-likelihood decoding problem is known to be NP-hard for general linear and Reed-Solomon codes. In this paper, we introduce the notion of A-covered codes, that is, codes…