On the decomposition of prefix codes

Antonio Restivo, Sabrina Mantaci, Clelia De Felice

Risultato della ricerca: Article

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.
Lingua originaleEnglish
pagine (da-a)117-130
Numero di pagine14
RivistaTheoretical Computer Science
Volume664
Stato di pubblicazionePublished - 2017

Fingerprint

Prefix
Decomposition
Decompose
Decomposable
Partial

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cita questo

On the decomposition of prefix codes. / Restivo, Antonio; Mantaci, Sabrina; De Felice, Clelia.

In: Theoretical Computer Science, Vol. 664, 2017, pag. 117-130.

Risultato della ricerca: Article

@article{77b7413c34df4588bc8c52b76c6f534d,
title = "On the decomposition of prefix codes",
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.",
author = "Antonio Restivo and Sabrina Mantaci and {De Felice}, Clelia",
year = "2017",
language = "English",
volume = "664",
pages = "117--130",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",

}

TY - JOUR

T1 - On the decomposition of prefix codes

AU - Restivo, Antonio

AU - Mantaci, Sabrina

AU - De Felice, Clelia

PY - 2017

Y1 - 2017

N2 - 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.

AB - 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.

UR - http://hdl.handle.net/10447/230629

UR - http://www.journals.elsevier.com/theoretical-computer-science/

M3 - Article

VL - 664

SP - 117

EP - 130

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

ER -