ajout de complexite

[canny.git] / stc.tex

diff --git a/stc.tex b/stc.tex
index 91f38d7abb1a7789c37ee8e399c38c99112fa41c..09ae4363ed1e98775c4499b5cdd1c826212bd659 100644 (file)
--- a/stc.tex
+++ b/stc.tex
@@ -71,7 +71,7 @@ First of all, Filler \emph{et al.} compute the matrix $H$
 by placing a small sub-matrix $\hat{H}$ of size $h × w$ next
 to each other and by shifting down by one row. 
 Thanks to this special form of $H$, one can represent
 by placing a small sub-matrix $\hat{H}$ of size $h × w$ next
 to each other and by shifting down by one row. 
 Thanks to this special form of $H$, one can represent

-every solution of  $m=Hy$ as a path through a trellis.
+any solution of  $m=Hy$ as a path through a trellis.

 
 Next, the  process of finding $y$ consists in two stages: a forward and a backward part.
 \begin{enumerate}
 
 Next, the  process of finding $y$ consists in two stages: a forward and a backward part.
 \begin{enumerate}