Compression and Coding Algorithms: The Springer International Series in Engineering and Computer Science, cartea 669
Autor Alistair Moffat, Andrew Turpinen Limba Engleză Hardback – 31 mar 2002
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 387.96 lei 6-8 săpt. | |
Springer Us – 30 oct 2012 | 387.96 lei 6-8 săpt. | |
Hardback (1) | 396.78 lei 6-8 săpt. | |
Springer Us – 31 mar 2002 | 396.78 lei 6-8 săpt. |
Din seria The Springer International Series in Engineering and Computer Science
- 24% Preț: 1041.97 lei
- 20% Preț: 643.50 lei
- 18% Preț: 1225.62 lei
- 18% Preț: 965.02 lei
- 20% Preț: 646.12 lei
- 18% Preț: 948.79 lei
- 20% Preț: 646.62 lei
- 15% Preț: 637.46 lei
- 20% Preț: 643.83 lei
- 18% Preț: 949.23 lei
- 20% Preț: 644.48 lei
- 20% Preț: 994.92 lei
- 20% Preț: 645.97 lei
- 18% Preț: 946.87 lei
- 20% Preț: 995.57 lei
- 18% Preț: 956.99 lei
- 20% Preț: 644.98 lei
- 15% Preț: 649.54 lei
- 18% Preț: 950.21 lei
- 18% Preț: 1221.38 lei
- 18% Preț: 957.62 lei
- 15% Preț: 643.99 lei
- 18% Preț: 948.47 lei
- 18% Preț: 947.35 lei
- 20% Preț: 1284.65 lei
- 20% Preț: 1633.95 lei
- 20% Preț: 1285.78 lei
Preț: 396.78 lei
Nou
Puncte Express: 595
Preț estimativ în valută:
75.93€ • 78.82$ • 63.32£
75.93€ • 78.82$ • 63.32£
Carte tipărită la comandă
Livrare economică 22 martie-05 aprilie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9780792376682
ISBN-10: 0792376684
Pagini: 275
Ilustrații: XII, 275 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.62 kg
Ediția:2002
Editura: Springer Us
Colecția Springer
Seria The Springer International Series in Engineering and Computer Science
Locul publicării:New York, NY, United States
ISBN-10: 0792376684
Pagini: 275
Ilustrații: XII, 275 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.62 kg
Ediția:2002
Editura: Springer Us
Colecția Springer
Seria The Springer International Series in Engineering and Computer Science
Locul publicării:New York, NY, United States
Public țintă
ResearchCuprins
1 Data Compression Systems.- 1.1 Why compression?.- 1.2 Fundamental operations.- 1.3 Terminology.- 1.4 Related material.- 1.5 Analysis of algorithms.- 2 Fundamental Limits.- 2.1 Information content.- 2.2 Kraft inequality.- 2.3 Human compression.- 2.4 Mechanical compression systems.- 3 Static Codes.- 3.1 Unary and binary codes.- 3.2 Elias codes.- 3.3 Golomb and Rice codes.- 3.4 Interpolative coding.- 3.5 Making a choice.- 4 Minimum-Redundancy Coding.- 4.1 Shannon-Fano codes.- 4.2 Huffman coding.- 4.3 Canonical codes.- 4.4 Other decoding methods.- 4.5 Implementing Huffman’s algorithm.- 4.6 Natural probability distributions.- 4.7 Artificial probability distributions.- 4.8 Doing the housekeeping chores.- 4.9 Related material.- 5 Arithmetic Coding.- 5.1 Origins of arithmetic coding.- 5.2 Overview of arithmetic coding.- 5.3 Implementation of arithmetic coding.- 5.4 Variations.- 5.5 Binary arithmetic coding.- 5.6 Approximate arithmetic coding.- 5.7 Table-driven arithmetic coding.- 5.8 Related material.- 6 Adaptive Coding.- 6.1 Static and semi-static probability estimation.- 6.2 Adaptive probability estimation.- 6.3 Coping with novel symbols.- 6.4 Adaptive Huffman coding.- 6.5 Adaptive arithmetic coding.- 6.6 Maintaining cumulative statistics.- 6.7 Recency transformations.- 6.8 Splay tree coding.- 6.9 Structured arithmetic coding.- 6.10 Pseudo-adaptive coding.- 6.11 The Q-coder.- 6.12 Making a choice.- 7 Additional Constraints.- 7.1 Length-limited coding.- 7.2 Alphabetic coding.- 7.3 Alternative channel alphabets.- 7.4 Related material.- 8 Compression Systems.- 8.1 Sliding window compression.- 8.2 Prediction by partial matching.- 8.3 Burrows-Wheeler transform.- 8.4 Other compression systems.- 8.5 Lossy modeling.- 9 What Next?.- References.