But that's not a problem.
For s_ure you c_n unders_and what I am w_iting?
Isn'_ i_?
W___ it _s s_ __ce __ b_ ab__ _o __l_x _ __t
__ ___ ____?

137089
144270
13__29
__4_49
______


Number of letters? No: in Hebrew all wovels can be omitted

First and last matters? No:  _ell_, _oda_ __ _ _onderfu_ _a_

Number of possible instantiations of the underscores that make sense. Yes!
i.e. REDUNDANCY

"Theory of information and transmission course"
Two fundamental quantities of my data:
1) amount of information transmitted
2) amount of bits used to encode this information

Of course 2>=1, the greater it is the more redundancy is there,
the less, the more entropy is there.


So, what? We can study how to

1) increase entropy   ===>   (loss-less) compression!
2) decrease entropy   ===>   to augment redundancy before transmission
                             in order to detect and repair transmission
                             failures

Example of 2:

to transmit   1 3 2 2 5 1 4
if I transmit 1 3 2 2 5 1 4  I cannot detect errros
if I transmit 11 33 22 22 55 11 44  I can detect 1 error and repair none
if I transmit 111 333 222 222 555 111 444
 I can detect 1 or 2 errors and repair one error with high probability