X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/canny.git/blobdiff_plain/70660073a3e38d00d230d6be415339e48cc23ead..e1c34dc36c5b5d8e9470b0baa3b5e5f80a8647e9:/stc.tex?ds=sidebyside

diff --git a/stc.tex b/stc.tex
index 6570c73..e8c695c 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}