X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/canny.git/blobdiff_plain/8290657e61738a93b7b6eb60966c49efbc4f0af8..b335b39d3ad21e598f9a7172a3e95ffe0d48a736:/stc.tex

diff --git a/stc.tex b/stc.tex
index 6570c73..7ce100b 100644
--- a/stc.tex
+++ b/stc.tex
@@ -58,10 +58,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 
+Unfortunately, for any given $H$, finding $y$ that solves $Hy=m$ and that 
 that minimizes $D_X(x,y)$ has exponential complexity with respect to $n$. 
 The Syndrome-Trellis Codes  (STC) 
 presented by Filler et al. in~\cite{DBLP:conf/mediaforensics/FillerJF10} 
@@ -80,6 +77,6 @@ Next, the  process of finding $y$ consists of a forward and a backward part:
 \item Backward determinization of $y$ which minimizes $D$ starting with 
 the complete path with minimal weight
 \end{enumerate} 
-Let us now give some details about these two parts.
+