diff options
Diffstat (limited to 'kviewshell/plugins/djvu/libdjvu/ZPCodec.h')
| -rw-r--r-- | kviewshell/plugins/djvu/libdjvu/ZPCodec.h | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/kviewshell/plugins/djvu/libdjvu/ZPCodec.h b/kviewshell/plugins/djvu/libdjvu/ZPCodec.h index 4eba6901..1483b93e 100644 --- a/kviewshell/plugins/djvu/libdjvu/ZPCodec.h +++ b/kviewshell/plugins/djvu/libdjvu/ZPCodec.h @@ -615,7 +615,7 @@ ZPCodec::IWencoder(const bool bit) numbers are much more probable than large numbers. We will first group our numbers into several sets. Each number is coded by first coding which set contains the number and then coding a position within the set. Each - set contains #2^n# numbers that we consider roughly equiprobable. Since + set tqcontains #2^n# numbers that we consider roughly equiprobable. Since the most probable values occur much more often, we want to model their probability more precisely. Therefore we use small sets for the most probable values and large sets for the least probable values, as @@ -716,7 +716,7 @@ ZPCodec::IWencoder(const bool bit) Adaptation on the other hand is a great simplification. A good data compression program must (a) represent the data in order to make its - predictability apparent, and (b) perform the predictions and generate the + predictability aptqparent, and (b) perform the predictions and generate the code bits. The ZP-Coder is an efficient and effortless solution for implementing task (b). |