Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4952267 | Theoretical Computer Science | 2017 | 14 Pages |
Abstract
In this paper we focus on the decomposition of rational and maximal prefix codes. We present an effective procedure that allows us to decide whether such a code is decomposable. In this case, the procedure also produces the factors of some of its decompositions. We also give partial results on the problem of deciding whether a rational maximal prefix code decomposes over a finite prefix code.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Clelia De Felice, Sabrina Mantaci, Antonio Restivo,