|
|
|
@ -878,7 +878,7 @@ We can see that the differences between two numbers in an ordered list
|
|
|
|
|
produces numbers that are shorter than the original numbers. Upon
|
|
|
|
|
receiving this list, Bob can reconstruct the original list by simply
|
|
|
|
|
adding each number with its predecessor. That means we save space
|
|
|
|
|
without losing any information, which is called _lossless encoding_.
|
|
|
|
|
without losing any information, which is ((("lossless encoding")))called _lossless encoding_.
|
|
|
|
|
|
|
|
|
|
If we randomly select numbers within a fixed range of values, then the
|
|
|
|
|
more numbers we select, the smaller the average (mean) size of the
|
|
|
|
|