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

diff --git a/stc.tex b/stc.tex
index db98585..0d1541a 100644
--- a/stc.tex
+++ b/stc.tex
@@ -19,9 +19,9 @@ $m$ for a given binary matrix $H$.
 
 Let us explain this embedding on a small illustrative example where
 $m$ and $x$ are respectively  a 3 bits column
-vector and a 7 bits column vector and where 
+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 $0$ otherwise).  
+(\textit{i.e.}, $\rho_X(i,x,y) = 0$ if $x = y$ and $1$ otherwise).  
 
 Let  $H$ be the binary Hamming matrix  
 $$
@@ -59,8 +59,8 @@ at most 1 bit.
 In the general case, communicating a message of $p$ bits in a cover of 
 $n=2^p-1$ pixels needs $1-1/2^p$ average changes.
 
-This Hamming embeding is really efficient to very small payload and is 
-not well suited when the size of the message is larger, as in real situation.
+This Hamming embedding is really efficient to very small payload and is 
+not well suited when the size of the message is larger, as in real situations.
 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$.