On unique, multiset, set decipherability of three-word codes

The concepts of unique decipherability (UD), multiset decipherability (MSD), and set decipherability (SD) of codes were developed to handle some special problems in the transmission of information. In unique decipherability, different sequences of codewords carry different information. In multiset decipherability, the information of interest is the multiset of codewords used in the encoding process so that order in which transmitted words are received is immaterial. In set decipherability, it is the set of codewords that is relevant information so the order and the multiplicity of words are immaterial. Lempel (1986) showed that the UD and MSD properties coincide for two-word codes and conjectured that every three-word MSD code is a UD code. Guzman (1995) showed that the UD, MSD, and SD properties coincide for two-word codes and conjectured that these properties coincide for three-word codes. In this paper, we answer both conjectures positively for all three-word codes {C/sub 1/, C/sub 2/, C/sub 3/} satisfying |C/sub 1/|=|C/sub 2/|/spl les/|C/sub 3/|. Our procedures are based on techniques related to dominoes.

[1]  Tero Harju,et al.  Splicing semigroups of dominoes and DNA , 1991, Discret. Appl. Math..

[2]  A. A. Markov.  Nonrecurrent Codes with Minimal Decoding Complexity , 1973 .

[3]  Renato M. Capocelli.  A note on uniquely decipherable codes (Corresp.) , 1979, IEEE Trans. Inf. Theory.

[4]  R. Gallager.  Information Theory and Reliable Communication , 1968 .

[5]  H. Shyr.  Free monoids and languages , 1979 .

[6]  Abraham Lempel.  On multiset decipherable codes , 1986, IEEE Trans. Inf. Theory.

[7]  Tero Harju,et al.  Dominoes Over a Free Monoid , 1982, Theor. Comput. Sci..

[8]  Tom Head,et al.  Deciding multiset decipherability , 1995, IEEE Trans. Inf. Theory.

[9]  Francine Blanchet-Sadri,et al.  Inclusion Relations Between Some Congruences Related to the Dot-depth Hierarchy , 1996, Discret. Appl. Math..

[10]  J. Berstel,et al.  Theory of codes , 1985 .

[11]  Antonio Restivo.  A note on multiset decipherable codes , 1989, IEEE Trans. Inf. Theory.

[12]  J. C. Spehner.  Quelques Constructions Et Algorithmes Relatifs Aux Sous-Monoïdes D'un Monoïde Libre , 1974 .

[13]  Francine Blanchet-Sadri,et al.  Equations and Monoid Varieties of Dot-Depth One and Two , 1994, Theor. Comput. Sci..

[14]  Alfred V. Aho,et al.  Efficient string matching , 1975, Commun. ACM.

[15]  Tom Head,et al.  The finest homophonic partition and related code concepts , 1994, IEEE Trans. Inf. Theory.

[16]  G. Lallement.  Semigroups and combinatorial applications , 1979 .

[17]  Ronald V. Book.  The base of the intersection of two free submonoids , 1985, Discret. Appl. Math..

[18]  F. Blanchet-Sadri,et al.  NOTE ON DECIPHERABILITY OF THREE-WORD CODES , 2002 .

[19]  Raffaele Giancarlo,et al.  Pattern Matching Machine Implementation of a Fast Test for Unique Decipherability , 1984, Inf. Process. Lett..

[20]  Jorge Almeida.  Some algorithms on the star operation applied to finite languages , 1984 .

[21]  Christoph M. Hoffmann.  A Note on Unique Decipherability , 1984, MFCS.

[22]  Fernando Guzmán,et al.  Decipherability of codes , 1999 .

[23]  Francine Blanchet-Sadri,et al.  Some Logical Characterizations of the Dot-Depth Hierarchy and Applications , 1995, J. Comput. Syst. Sci..

[24]  Michael Rodeh.  A fast test for unique decipherability based on suffix trees , 1982, IEEE Trans. Inf. Theory.