2 - Entropy and Coding
Published online by Cambridge University Press: 05 September 2016
- Type
- Chapter
- Information
- Compact Data StructuresA Practical Approach, pp. 14 - 38Publisher: Cambridge University PressPrint publication year: 2016
References
and (2005). Inverted index compression using word-aligned binary codes. Information Retrieval, 8, 151–166.Google Scholar
and (2011). Modern Information Retrieval. Addison-Wesley, 2nd edition.
, , and (1990). Text compression. Prentice Hall.
, , and (2010). Information Retrieval: Implementing and Evaluating Search Engines. MIT Press.
and (2006). Elements of Information Theory. Wiley, 2nd edition.
(2006). Large alphabets and incompressibility. Information Processing Letters, 99(6), 246–251.Google Scholar
, , , and (2015). Efficient and compact representations of prefix codes. IEEE Transactions on Information Theory, 61(9), 4999–5011.Google Scholar
, , and (1994). Concrete Mathematics – A Foundation for Computer Science. Addison-Wesley, 2nd edition.
(1978). Information Retrieval: Theoretical and Computational Aspects. Academic Press.
(1952). A method for the construction of minimum-redundancy codes. Proceedings of the Institute of Electrical and Radio Engineers, 40(9), 1098–1101.Google Scholar
and (1976). Huffman codes and self-information. IEEE Transactions on Information Theory, 22(3), 337–340.Google Scholar
and (2006). Decoding prefix codes. Software Practice and Experience, 36(15), 1687–1710.Google Scholar
and (2002). Compression and Coding Algorithms. Springer.
, , and (2013). Data Compression: The Complete Reference. Springer.
and (1964). Generating a canonical prefix encoding. Communications of the ACM, 7, 166–169.Google Scholar
and (2013). An Introduction to the Analysis of Algorithms.Addison-Wesley- Longman, 2nd edition.
(1948). A mathematical theory of communication. Bell Systems Technical Journal, 27, 398–403.Google Scholar
and (1949). A Mathematical Theory of Communication. University of Illinois Press.
and (2010). VSEncoding: efficient coding and fast decoding of integer lists via dynamic programming. In Proc. 19th ACM Conference on Information and Knowledge Management (CIKM), pages 1219–1228.Google Scholar
(2007). Variable-Length Codes for Data Compression. Springer-Verlag.
(1988). Data Compression: Methods and Theory. Addison-Wesley.
(2014). Compression, SIMD, and postings lists. In Proc. 19th Australasian Document Computing Symposium (ADCS), page 50.Google Scholar
and (1999). Compressing integers for fast file access. The Computer Journal, 42, 193–201.Google Scholar
, , and (1987). Arithmetic coding for data compression. Communications of the ACM, 30, 520–540.Google Scholar
, , and (1999). Managing Gigabytes: Compressing and Indexing Documents and Images. Van Nostrand Reinhold, 2nd edition.
, , , and (2006). Super-scalar RAM-CPU cache compression. In Proc. 22nd International Conference on Data Engineering (ICDE), page 59.Google Scholar