X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/canny.git/blobdiff_plain/5e6f9e49a26cec4970434722a595a7b44197120f..c6d3dd0e0b8e5c982b6a8d28649ab4079666815d:/stc.tex

diff --git a/stc.tex b/stc.tex
index 7ce100b..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
