Fibonacci-Like Polynomials Produced by m-ary Huffman Codes for Absolutely Ordered Sequences
Alex Vinokur
TL;DR
This paper introduces Fibonacci-like polynomials generated by m-ary Huffman codes specifically designed for absolutely ordered sequences, expanding the understanding of code-based polynomial structures.
Contribution
It presents a novel method for producing Fibonacci-like polynomials using m-ary Huffman codes tailored for absolutely ordered sequences, which is a new approach in coding theory.
Findings
Fibonacci-like polynomials can be generated by m-ary Huffman codes.
The method applies to absolutely ordered sequences.
Potential applications in coding and sequence analysis.
Abstract
Fibonacci-like polynomials produced by m-ary Huffman codes for absolutely ordered sequences have been described.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Coding theory and cryptography · semigroups and automata theory