X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/canny.git/blobdiff_plain/e556b479316abe0d4183c94c28a84f07f9f64c9c..3cb99fa4936f62fef8a0f24880e7d9bca9c31a9e:/stc.tex?ds=inline

diff --git a/stc.tex b/stc.tex
index a544278..f87104b 100644
--- a/stc.tex
+++ b/stc.tex
@@ -1,3 +1,5 @@
+To make this article self-contained, this section recalls
+basis of the Syndrome Treillis Codes  (STC).
 Let 
 $x=(x_1,\ldots,x_n)$ be the $n$-bits cover vector of the image $X$, 
 $m$ be the message to embed, and 
@@ -60,7 +62,7 @@ $2^n-1$ pixels needs $1-1/2^n$ average changes.
 
 Unfortunately, for any given $H$, finding $y$ that solves $Hy=m$ and  
 that minimizes $D_X(x,y)$, has an exponential complexity with respect to $n$. 
-The Syndrome-Trellis Codes  (STC) 
+The Syndrome-Trellis Codes  
 presented by Filler \emph{et al.} in~\cite{DBLP:conf/mediaforensics/FillerJF10} 
 is a practical solution to this complexity. Thanks to this contribution,
 the solving algorithm has a linear complexity with respect to $n$.