c数值分析c20-5.pdfVIP

910 Chapter 20. Less-Numerical Algorithms 20.5 Arithmetic Coding We saw in the previous section that a perfect (entropy-bounded) coding scheme would use Li = − log2 pi bits to encode character i (in the range 1 ≤ i ≤ N ch), if pi is its probability of occurrence. Huffman coding gives a way of rounding the h r P C S t e e o a L ’s to close integer values and constructing a code with those lengths. Arithmetic t a i p d r p m : m y / a p [1] / i r w coding , which we now discuss, actually does manage to encode characters using b s i l w l s g e e i h p noninteger numbers of bits! It also provides a convenient way to ou