On the decomposition of prefix codes

Sabrina Mantaci, Antonio Restivo, Clelia De Felice, 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

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Entra nei temi di ricerca di 'On the decomposition of prefix codes'. Insieme formano una fingerprint unica.

  • Cita questo

    Mantaci, S., Restivo, A., De Felice, C., & De Felice, C. (2017). On the decomposition of prefix codes. Theoretical Computer Science, 664, 117-130.