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.
De Felice, C., Mantaci, S., Restivo, A. (2017). On the decomposition of prefix codes. THEORETICAL COMPUTER SCIENCE, 664, 117-130 [10.1016/j.tcs.2015.12.002].
On the decomposition of prefix codes
MANTACI, Sabrina;RESTIVO, Antonio
2017-01-01
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.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
1-s2.0-S030439751501141X-main.pdf
Solo gestori archvio
Tipologia:
Versione Editoriale
Dimensione
458.62 kB
Formato
Adobe PDF
|
458.62 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
