Abstract
Text compression requires numbers to represented as compactly as possible, especially the more-frequent values. This chapter describes various compact representations, and especially the "Universal Codes" to represent arbitrarily large values. Many of these codes are seldom mentioned in general literature.
Keywords: Shannon-Fano codes, Hu man codes, Elias` α, β, γ and ω codes, Rice codes, Golomb codes, start-step-stop codes, ternary comma codes, Fibonacci codes, Goldbach and Ibsen codes, Wheeler 1/2 code.
Related Journals
Related Books
Computational Intelligence For Data Analysis
Machine Learning and Its Application: A Quick Guide for Beginners
Applied Machine Learning and Multi-Criteria Decision-Making in Healthcare
A First Course in Artificial Intelligence
Artificial Intelligence: Models, Algorithms and Applications
Advanced Computing Techniques: Implementation, Informatics and Emerging Technologies
Handbook of Mobile Application Development: A Guide to Selecting the Right Engineering and Quality Features
Ad Hoc and Sensor Wireless Networks: Architectures, Algorithms and Protocols
Applications of Modern High Performance Networks
Arduino Meets Matlab: Interfacing, Programs and Simulink