Generalized Kraft Inequality and Arithmetic Coding

DOI10.1147/RD.203.0198MaRDI QIDQ4108230zbMATH OpenOpenAlexWikidataFDO

Authors Jorma Rissanen

Publication date 1976

Published in IBM Journal of Research and Development (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/9fcb8d85e3d429f3816861fc7999e1bb68eefd39

Mathematics Subject Classification ID

Information theory (general) (94A15) Theory of error-correcting codes and error-detecting codes (94B99)

Cited in

(17)

• Modeling by shortest data description
• Hierarchy representations based on arithmetic coding for dynamic information protection systems
• Lempel-Ziv data compression on parallel and distributed systems
• Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases
• Estimating dynamical dimensions from noisy observations
• Binary image compression via monochromatic pattern substitution: sequential and parallel implementations
• A sensor-based framework for kinetic data compression
• A SIMPLE LOSSLESS COMPRESSION HEURISTIC FOR GREY SCALE IMAGES
• Adaptive arithmetic coding using fuzzy reasoning and grey prediction
• Lightweight compression with encryption based on asymmetric numeral systems
• Scalability and communication in parallel low-complexity lossless compression
• Algorithm 1036: ATC, an advanced Tucker compression library for multidimensional data
• Is Huffmann coding dead?
• Text compression methods
• Branching frequency and Markov entropy of repetition-free languages
• Dynamic Shannon coding
• Error recovery properties and soft decoding of quasi-arithmetic codes

This page was built for publication: Generalized Kraft Inequality and Arithmetic Coding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4108230)