X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/canny.git/blobdiff_plain/bd2fce977129b24b117509715dada6f0c0a0f98a..9c37522d37b3caa216649cc98987e4c89b42091f:/stc.tex?ds=sidebyside

diff --git a/stc.tex b/stc.tex
index 0d1541a..c195fca 100644
--- a/stc.tex
+++ b/stc.tex
@@ -1,5 +1,6 @@
 To make this article self-contained, this section recalls
-the basis of the Syndrome Treillis Codes  (STC).
+the basis of the Syndrome Treillis Codes  (STC). 
+\JFC{A reader that 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$, 
@@ -23,9 +24,9 @@ vector and a 7 bits column vector, and where
 $\rho_X(i,x,y)$ is equal to 1 for any $i$, $x$, $y$
 (\textit{i.e.}, $\rho_X(i,x,y) = 0$ if $x = y$ and $1$ otherwise).  
 
-Let  $H$ be the binary Hamming matrix  
+Let  $\dot{H}$ be the binary Hamming matrix  
 $$
-H = \left(
+\dot{H} = \left(
 \begin{array}{lllllll}
  0 & 0 & 0 & 1 & 1 & 1 & 1 \\
  0 & 1 & 1 & 0 & 0 & 1 & 1 \\
@@ -33,11 +34,11 @@ H = \left(
 \end{array}
 \right).
 $$
-The objective is to modify $x$ to get $y$ s.t. $m = Hy$.
+The objective is to modify $x$ to get $y$ s.t. $m = \dot{H}y$.
 In this algebra, the sum and the product respectively correspond to
 the exclusive \emph{or} and to the \emph{and} Boolean operators.
-If $Hx$ is already equal to $m$, nothing has to be changed and $x$ can be sent.
-Otherwise we consider the difference $\delta = d(m,Hx)$, which is expressed 
+If $\dot{H}x$ is already equal to $m$, nothing has to be changed and $x$ can be sent.
+Otherwise we consider the difference $\delta = d(m,\dot{H}x)$, which is expressed 
 as a vector : 
 $$
 \delta = \left( \begin{array}{l}
@@ -53,7 +54,7 @@ We denote by $\overline{x}^j$ the vector  obtained by
 switching the $j-$th component of $x$, 
 that is, $\overline{x}^j = (x_1 , \ldots, \overline{x_j},\ldots, x_n )$.
 It is not hard to see that if $y$ is $\overline{x}^j$, then 
-$m = Hy$.
+$m = \dot{H}y$.
 It is then possible to embed 3 bits in 7 LSBs of pixels by modifying
 at most 1 bit.
 In the general case, communicating a message of $p$ bits in a cover of