2000 character limit reached
Abstract Huffman Coding and PIFO Tree Embeddings
Published 7 Jan 2023 in cs.IT, cs.DS, and math.IT | (2301.02878v1)
Abstract: Algorithms for deriving Huffman codes and the recently developed algorithm for compiling PIFO trees to trees of fixed shape (Mohan et al. 2022) are similar, but work with different underlying algebraic operations. In this paper, we exploit the monadic structure of prefix codes to create a generalized Huffman algorithm that has these two applications as special cases.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
