Weighted forward looking adaptive coding

DOI10.1016/J.TCS.2022.07.013MaRDI QIDQ2166764zbMATH OpenOpenAlexFDO

Authors Aharon Fruchtman, Y. Gross, Shmuel T. Klein, 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 codingHuffman codinglossless data compressionstatic and dynamic coding

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Forward looking Huffman coding
• Forward looking Huffman coding
• Bidirectional adaptive compression
• Dynamic huffman coding
• A nearly-optimal Fano-based coding algorithm

Cites work

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

Cited in

(1)

• Selective dynamic compression

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

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