TL;DR
This paper introduces a new class of variable-length codes with unique prefix-suffix properties, extending existing fix-free and non-overlapping codes, along with algorithms for their construction and analysis of their size.
Contribution
It defines a novel class of codes, provides constructive algorithms for their creation, and presents numerical results on their cardinality.
Findings
Algorithms for constructing variable-length non-overlapping codes
Numerical analysis of code cardinality
Extension of fix-free and non-overlapping codes
Abstract
We define a variable-length code having the property that no (non-empty) prefix of each its codeword is a suffix of any other one, and vice versa. This kind of code can be seen as an extension of two well-known codes in literature, called respectively fix-free code and non-overlapping code. In this paper, some constructive algorithms for such codes are presented as well as numerical results about their cardinality.
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.