Generalized Kraft Inequality and Arithmetic Coding
From MaRDI portal
Publication:4108230
DOI10.1147/rd.203.0198zbMath0339.94009OpenAlexW2046419776WikidataQ56094440 ScholiaQ56094440MaRDI QIDQ4108230
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
Information theory (general) (94A15) Theory of error-correcting codes and error-detecting codes (94B99)
Related Items (16)
Branching frequency and Markov entropy of repetition-free languages ⋮ Dynamic Shannon coding ⋮ Modeling by shortest data description ⋮ Lightweight compression with encryption based on asymmetric numeral systems ⋮ Scalability and communication in parallel low-complexity lossless compression ⋮ Estimating dynamical dimensions from noisy observations ⋮ Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases ⋮ A sensor-based framework for kinetic data compression ⋮ Error recovery properties and soft decoding of quasi-arithmetic codes ⋮ Lempel-Ziv data compression on parallel and distributed systems ⋮ A SIMPLE LOSSLESS COMPRESSION HEURISTIC FOR GREY SCALE IMAGES ⋮ Hierarchy representations based on arithmetic coding for dynamic information protection systems ⋮ Is Huffmann coding dead? ⋮ Binary image compression via monochromatic pattern substitution: sequential and parallel implementations ⋮ Adaptive arithmetic coding using fuzzy reasoning and grey prediction ⋮ Text compression methods
This page was built for publication: Generalized Kraft Inequality and Arithmetic Coding
