|
|
|
|
| LEADER |
03503nmm a2200349 u 4500 |
| 001 |
EB000614779 |
| 003 |
EBX01000000000000000467861 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9780387217086
|
| 100 |
1 |
|
|a Salomon, David
|
| 245 |
0 |
0 |
|a A Guide to Data Compression Methods
|h Elektronische Ressource
|c by David Salomon
|
| 250 |
|
|
|a 1st ed. 2002
|
| 260 |
|
|
|a New York, NY
|b Springer New York
|c 2002, 2002
|
| 300 |
|
|
|a XII, 295 p
|b online resource
|
| 505 |
0 |
|
|a 1. Statistical Methods -- 1 Entropy -- 2 Variable-Size Codes -- 3 Decoding -- 4 Huffman Coding -- 5 Adaptive Huffman Coding -- 6 Facsimile Compression -- 7 Arithmetic Coding -- 8 Adaptive Arithmetic Coding -- 2. Dictionary Methods -- 1 LZ77 (Sliding Window) -- 2 LZSS -- 3 LZ78 -- 4 LZW -- 5 Summary -- 3. Image Compression -- 1 Introduction -- 2 Image Types -- 3 Approaches to Image Compression -- 4 Intuitive Methods -- 5 Image Transforms -- 6 Progressive Image Compression -- 7 JPEG -- 8 JPEG-LS -- 4. Wavelet Methods -- 1 Averaging and Differencing -- 2 The Haar Transform -- 3 Subband Transforms -- 4 Filter Banks -- 5 Deriving the Filter Coefficients -- 6 The DWT -- 7 Examples -- 8 The Daubechies Wavelets -- 9 SPIHT -- 5. Video Compression -- 1 Basic Principles -- 2 Suboptimal Search Methods -- 6. Audio Compression -- 1 Sound -- 2 Digital Audio -- 3 The Human Auditory System -- 4 Conventional Methods -- 5 MPEG-1 Audio Layers -- Joining the Data Compression Community -- Appendix of Algorithms
|
| 653 |
|
|
|a Coding and Information Theory
|
| 653 |
|
|
|a Coding theory
|
| 653 |
|
|
|a Cryptography
|
| 653 |
|
|
|a Information theory
|
| 653 |
|
|
|a Data encryption (Computer science)
|
| 653 |
|
|
|a Information retrieval
|
| 653 |
|
|
|a Cryptology
|
| 653 |
|
|
|a Data Storage Representation
|
| 653 |
|
|
|a Computer architecture
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 028 |
5 |
0 |
|a 10.1007/978-0-387-21708-6
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-0-387-21708-6?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 005.72
|
| 520 |
|
|
|a In 1829, Louis Braille, a young organist in a Paris church, blind since age 3, invented the well-known code for the blind, still in common use today all over the world and named after him. Braille himself modified his code in 1834, and there have been several modifications since. However, the basic design of this code, where each character is represented by a group of 3 x 2 dots, has remained intact. The dots are embossed on thick paper and each can be raised or flat (i. e. , present or absent). Each dot is therefore equivalent to one bit of information. As a result, the Braille code (Figure 1) is a 6-bit code and can therefore represent 64 symbols (the code of six flat dots indicates a blank space). Braille's followers extended the capabilities of his code in several ways. One im portant extension is contractions. These are letters that, when they stand alone, mean words. For example, the letter "b" standing alone (or with punctuation) means the word "but," the letter "e" standing alone means "every," and "p" means "people. " Another extension is short-form words. These are combinations of two or more codes that mean an entire word (short-form words may contain contractions). For example, "ab" means "about," "rcv" means "receive," and "(the)mvs" means "themselves. " (The "the" in parentheses is a contraction, dots 2-3-4-6. ) Figure 2 shows some examples of these special codes
|