2016/11/14 by Clelia De Felice, De Felice, Clelia
Computer Science · Mathematics · #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Information Theory (cs.IT) #cs.FL #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1611.04580
arxiv created 2016/11/14 · arxiv updated 2016/11/15
Variable-length codes are the bases of the free submonoids of a free monoid. There are some important longstanding open questions about the structure of finite maximal codes. In this paper we discuss this conjectures and their relations with factorizations of cyclic groups.