Weighted forward looking adaptive coding

DOI10.1016/J.TCS.2022.07.013OpenAlexW4285602468MaRDI QIDQ2166764

Aharon Fruchtman, Shmuel T. Klein, Y. Gross, Dana Shapira

Publication date: 25 August 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2005.08232

zbMATH Keywords

arithmetic codinglossless data compressionHuffman codingstatic and dynamic coding

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Average case analyses of list update algorithms, with applications to data compression
• Fixed block compression boosting in FM-indexes: theory and practice
• Boosting textual compression in optimal linear time
• Dynamic huffman coding
• Design and analysis of dynamic Huffman codes
• A locally adaptive data compression scheme
• An application of informational divergence to Huffman codes
• Data compression via textual substitution
• Universal codeword sets and representations of the integers
• Variations on a theme by Huffman
• A Method for the Construction of Minimum-Redundancy Codes
• On Information and Sufficiency
• Forward looking Huffman coding
• On the competitive theory and practice of online list accessing algorithms

This page was built for publication: Weighted forward looking adaptive coding