Variable-length Non-overlapping Codes
Information Theory
2016-05-13 v1 Discrete Mathematics
math.IT
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.
Keywords
Cite
@article{arxiv.1605.03785,
title = {Variable-length Non-overlapping Codes},
author = {Stefano Bilotta},
journal= {arXiv preprint arXiv:1605.03785},
year = {2016}
}