X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/canny.git/blobdiff_plain/1bfb9cc8f38edd065a52de421a0dc41567c4262c..3d3a92a59f998403d73c474b6565a18b3c248dec:/stc.tex?ds=inline

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