Compression and Coding Algorithms de Alistair Moffat

Compression and Coding Algorithms: The Springer International Series in Engineering and Computer Science, cartea 669

Alistair Moffat

Andrew Turpin

Compression and Coding Algorithms describes in detail the coding mechanisms that are available for use in data compression systems. The well known Huffman coding technique is one mechanism, but there have been many others developed over the past few decades, and this book describes, explains and assesses them. People undertaking research of software development in the areas of compression and coding algorithms will find this book an indispensable reference. In particular, the careful and detailed description of algorithms and their implementation, plus accompanying pseudo-code that can be readily implemented on computer, make this book a definitive reference in an area currently without one.

Citește tot Restrânge

Toate formatele și edițiile

	Preț	Express
Paperback (1)	373^.24 lei 6-8 săpt.
Springer Us – 30 oct 2012	373^.24 lei 6-8 săpt.
Hardback (1)	381^.72 lei 6-8 săpt.
Springer Us – 31 mar 2002	381^.72 lei 6-8 săpt.

Din seria The Springer International Series in Engineering and Computer Science

20%

Preț: 594^.49 lei
24%

Preț: 859^.55 lei
20%

Preț: 1847^.13 lei
20%

Preț: 1228^.27 lei
24%

Preț: 866^.26 lei
18%

Preț: 609^.91 lei
20%

Preț: 618^.64 lei
20%

Preț: 569^.56 lei
18%

Preț: 733^.28 lei
18%

Preț: 1177^.92 lei
18%

Preț: 927^.56 lei
20%

Preț: 621^.14 lei
18%

Preț: 911^.94 lei
20%

Preț: 621^.64 lei
15%

Preț: 612^.85 lei
20%

Preț: 618^.96 lei
18%

Preț: 912^.40 lei
20%

Preț: 619^.58 lei
20%

Preț: 950^.07 lei
20%

Preț: 621^.01 lei
18%

Preț: 910^.11 lei
20%

Preț: 956^.89 lei
18%

Preț: 919^.85 lei
20%

Preț: 620^.07 lei
15%

Preț: 617^.89 lei
18%

Preț: 913^.32 lei
18%

Preț: 1173^.85 lei
18%

Preț: 920^.45 lei
15%

Preț: 619^.12 lei
18%

Preț: 911^.64 lei
18%

Preț: 910^.58 lei
20%

Preț: 1234^.64 lei

Cuprins

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.