X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/canny.git/blobdiff_plain/5178f772a789c49b261c48acc466a982d413a9a9..refs/heads/master:/stc.tex

diff --git a/stc.tex b/stc.tex
index 5e5b66e..03733f5 100644
--- a/stc.tex
+++ b/stc.tex
@@ -1,6 +1,6 @@
 To make this article self-contained, this section recalls
 the basis of the Syndrome Treillis Codes  (STC). 
-\JFC{A reader who is familar with syndrome coding can skip it.}
+A reader who is familar with syndrome coding can skip it.
 
 Let 
 $x=(x_1,\ldots,x_n)$ be the $n$-bits cover vector issued from an image $X$, 
@@ -66,7 +66,7 @@ The matrix $H$ should be changed to deal with higher payload.
 Moreover, for any given $H$, finding $y$ that solves $Hy=m$ and  
 that minimizes $D_X(x,y)$, has an exponential complexity with respect to $n$. 
 The Syndrome-Trellis Codes  
-presented by Filler \emph{et al.} in~\cite{FillerJF11}
+presented by Filler \emph{et al.} \JFC{in~\cite{FillerJF11,liu2014syndrome}}
 is a practical solution to this complexity. Thanks to this contribution,
 the solving algorithm has a linear complexity with respect to $n$.