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$,
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$.
