Adaptive Codes: A New Class of Non-standard Variable-length Codes
Dragos Trinca

TL;DR
This paper introduces adaptive codes, a novel class of variable-length codes that adapt based on previous symbols, along with an efficient construction algorithm and a generalization called GA codes.
Contribution
The paper proposes adaptive codes and GA codes, providing new methods for variable-length encoding that depend on prior data, with an efficient construction algorithm for order-one codes.
Findings
Introduced adaptive codes as a new class of variable-length codes.
Developed an efficient algorithm for constructing adaptive codes of order one.
Generalized adaptive codes to a broader class called GA codes.
Abstract
We introduce a new class of non-standard variable-length codes, called adaptive codes. This class of codes associates a variable-length codeword to the symbol being encoded depending on the previous symbols in the input data string. An efficient algorithm for constructing adaptive codes of order one is presented. Then, we introduce a natural generalization of adaptive codes, called GA codes.
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 · Cellular Automata and Applications · DNA and Biological Computing
