2016/05/12 by Stefano Bilotta, Bilotta, Stefano · 1 citation
Computer Science · Mathematics · #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.DM #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1605.03785
arxiv created 2016/05/12 · arxiv updated 2016/05/13
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.