6533b857fe1ef96bd12b3a54
RESEARCH PRODUCT
On the decomposition of prefix codes
Sabrina MantaciAntonio RestivoClelia De Felicesubject
Block codePrefix codeGeneral Computer ScienceComputer science0102 computer and information sciences02 engineering and technologyPrefix grammarKraft's inequality01 natural sciencesPrefix codeTheoretical Computer SciencePrefix codes; Finite automata; Composition of codesComposition of codes0202 electrical engineering electronic engineering information engineeringDiscrete mathematicsSelf-synchronizing codeFinite-state machineSettore INF/01 - InformaticaComputer Science (all)Rational languageLinear codePrefixComposition of code010201 computation theory & mathematicsPrefix codes020201 artificial intelligence & image processingFinite automataComputer Science::Formal Languages and Automata Theorydescription
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.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2017-02-01 |