|
|||||||||||||||
Theoret. Informatics Appl. 39, 161-174 (2005)
DOI: 10.1051/ita:2005010
Some decompositions of Bernoulli sets and codes
Aldo de LucaDipartimento di Matematica e Applicazioni dell'Università di Napoli "Federico II", via Cintia, Complesso Universitario di Monte S. Angelo, 80126 Napoli, Italy and Istituto di Cibernetica "E. R. Caianiello" del CNR, 80078 Pozzuoli, Italy; aldo.deluca@dma.unina.it
Abstract
A decomposition of a set
X of words over a
d-letter alphabet
is any sequence
of subsets of
A* such that the sets
Xi,
are pairwise disjoint,
their union is
X, and for all
i,
,
, where ~
denotes the commutative equivalence relation. We introduce some suitable decompositions
that we call good, admissible, and normal. A normal decomposition is admissible and
an admissible decomposition is good. We prove that a set is commutatively
prefix if and only if it has a normal decomposition. In particular, we consider
decompositions of Bernoulli sets and codes. We prove that there exist Bernoulli sets
which have no good decomposition. Moreover, we show that the classical conjecture of
commutative equivalence of finite maximal codes to prefix ones is equivalent to the statement
that any finite and maximal code has an admissible decomposition.
Mathematics Subject Classification. 94A45
Key words: Bernoulli sets -- codes -- decompositions -- commutative equivalence.
© EDP Sciences 2005
| What is OpenURL? |
- If your librarian has set up your subscription with an OpenURL resolver, OpenURL links appear automatically on the abstract pages.
- You can define your own OpenURL resolver with your EDPS Account. In this case your choice will be given priority over that of your library.
- You can use an add-on for your browser (Firefox or I.E.) to display OpenURL links on a page (see http://www.openly.com/openurlref/). You should disable this module if you wish to use the OpenURL server that you or your library have defined.


Document
BibSonomy
CiteUlike
Connotea
Del.icio.us
Digg
Facebook