fin avant choix revue

[canny.git] / stc.tex

diff --git a/stc.tex b/stc.tex
index 09ae4363ed1e98775c4499b5cdd1c826212bd659..26ac732cb1805fe186b11981e1fcfb57283d9d5a 100644 (file)
--- a/stc.tex
+++ b/stc.tex
@@ -68,7 +68,7 @@ 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$
 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
 any solution of  $m=Hy$ as a path through a trellis.
 to each other and by shifting down by one row. 
 Thanks to this special form of $H$, one can represent
 any solution of  $m=Hy$ as a path through a trellis.