X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/canny.git/blobdiff_plain/e1c34dc36c5b5d8e9470b0baa3b5e5f80a8647e9..51c827b374614757c68f7d7cd8d799eb46f477e0:/stc.tex

diff --git a/stc.tex b/stc.tex
index e8c695c..16fbfb3 100644
--- a/stc.tex
+++ b/stc.tex
@@ -63,7 +63,7 @@ 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} 
 is a practical solution to this complexity. Thanks to this contribution,
-the solving algorithm has a linear complexity with resspect to $n$.
+the solving algorithm has a linear complexity with respect to $n$.
 
 First of all, Filler et al. compute the matrix $H$
 by placing a small sub-matrix $\hat{H}$ of size $h × w$ next
@@ -77,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.
+