Transducers for the bidirectional decoding of prefix codes

Risultato della ricerca: Article

3 Citazioni (Scopus)

Abstract

We construct a transducer for the bidirectional decoding of words encoded by the method introduced by Girod in and we prove that it is bideterministic and that it can be used both for the left-to-right and the right-to-left decoding. We also give a similar construction for a transducer that decodes in both directions words encoded by a generalization of the Girod’s encoding method. We prove that it keeps the same properties of the previous transducer. In addition we show that it has a single initial/final state and that it is minimal.
Lingua originaleEnglish
pagine (da-a)-
Numero di pagine8
RivistaTheoretical Computer Science
Volume2010
Stato di pubblicazionePublished - 2010

Fingerprint

Prefix
Transducer
Decoding
Transducers
Decode
Encoding

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cita questo

@article{2547ce84c21644f0b1ffa8acf4ee2026,
title = "Transducers for the bidirectional decoding of prefix codes",
abstract = "We construct a transducer for the bidirectional decoding of words encoded by the method introduced by Girod in and we prove that it is bideterministic and that it can be used both for the left-to-right and the right-to-left decoding. We also give a similar construction for a transducer that decodes in both directions words encoded by a generalization of the Girod’s encoding method. We prove that it keeps the same properties of the previous transducer. In addition we show that it has a single initial/final state and that it is minimal.",
keywords = "Prefix codes; Girod’s encoding; Transducers",
author = "Laura Giambruno and Sabrina Mantaci",
year = "2010",
language = "English",
volume = "2010",
pages = "--",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",

}

TY - JOUR

T1 - Transducers for the bidirectional decoding of prefix codes

AU - Giambruno, Laura

AU - Mantaci, Sabrina

PY - 2010

Y1 - 2010

N2 - We construct a transducer for the bidirectional decoding of words encoded by the method introduced by Girod in and we prove that it is bideterministic and that it can be used both for the left-to-right and the right-to-left decoding. We also give a similar construction for a transducer that decodes in both directions words encoded by a generalization of the Girod’s encoding method. We prove that it keeps the same properties of the previous transducer. In addition we show that it has a single initial/final state and that it is minimal.

AB - We construct a transducer for the bidirectional decoding of words encoded by the method introduced by Girod in and we prove that it is bideterministic and that it can be used both for the left-to-right and the right-to-left decoding. We also give a similar construction for a transducer that decodes in both directions words encoded by a generalization of the Girod’s encoding method. We prove that it keeps the same properties of the previous transducer. In addition we show that it has a single initial/final state and that it is minimal.

KW - Prefix codes; Girod’s encoding; Transducers

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

M3 - Article

VL - 2010

SP - -

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

ER -