论文信息 - On numerically decipherable codes and their homophonic partitions

On numerically decipherable codes and their homophonic partitions

We investigate the homophonic partitions of numerically decipherable (ND) codes in relationship with the notion of multivalued encodings. Moreover, we present a new class of codes, the class of homophonically decipherable (HD) codes, studying their Kraft-McMillan sum.

A. Savelli

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

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

[3] F. Blanchet-Sadri,et al. On unique, multiset, set decipherability of three-word codes , 2001, IEEE Trans. Inf. Theory.

[4] Luisa Gargano,et al. A Fast Algorithm for the Unique Decipherability of Multivalued Encodings , 1994, Theor. Comput. Sci..

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

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

[7] K. Sato. A decision procedure for the unique decipherability of multivalued encodings (Corresp.) , 1979, IEEE Trans. Inf. Theory.

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

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

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