| Details | | Publication Date: | 1999-09-30 | | Series: | For Real Programmers Series | | Edition Description: | Illustrated |
| Size | | Length: | 240 pages | | Height: | 9.3 in | | Width: | 7.3 in | | Thickness: | 0.8 in | | Weight: | 18.4 oz |
Publisher's Note Compression algorithms are a part of almost every software application. Whether the compression is used in transportation of large files, archiving important data, or efficient use of the Web, compression algorithms enable every user to manipulate mass quantities of information effectively and efficiently. This book is aimed at the programmer who must choose and implement good compression strategies. Compression algorithms are ideal for Internet and computer networks. In the world of ever-increasing file sizes, compression algorithms enable users, developers, and programmers to stay in control and work in an efficient manner. More and more programs are including complicated graphics or hefty data structures, and this book will explain how to cut their size.
In life, time is money, and on the Internet, the size of data is money. Small programs and small files take less disk space and cost less to send over the Internet. Compression Algorithms for Real Programmers describes the basic algorithms and approaches for compressing information so you can create the smallest files possible. These new algorithms are making it possible for people to take impossibly large audio and video files and compress them enough that they can flow over the Internet.
* Examines the classic algorithms like Huffman coding, arithmetic compression, and dictionary-based schemes in depth * Describes the basic approaches used to squeeze audio and video signals by factors of as much as 100:1 * Discusses the philosophy of compression to illustrate the underlying trade-offs in the algorithms * Explores the use of wavelets and other modeling techniques that use repetitive functions to squeeze audio and video * Shows how programming solutions like Adobe PostScript can save space and make networks more efficient * Describes new approaches using fractals and grammars just being explored by the compression community * Shows how to extend the algorithms and use them for copyright protection
| See an error? Submit a change request |