X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/canny.git/blobdiff_plain/457be557d1bb33d5d169605464822243e0ed6232..222b1caaf60e918817a332b5ce7774cf792fef59:/stc.tex?ds=sidebyside

diff --git a/stc.tex b/stc.tex
index 09ae436..26ac732 100644
--- 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$
-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.