论文信息 - On Uniquely Decipherable Codes with Two Codewords - 字舞流文

On Uniquely Decipherable Codes with Two Codewords

It is shown that every uniquely decipherable code with just two codewords has finite delay. In addition, if a uniquely decipherable code with just two codewords is full, then it is trivial.

Ronald V. Book | Sai Choi Kwan | S. C. Kwan | R. V. Book

[1] M. Schutzenberger,et al. On an application of semi groups methods to some problems in coding , 1956 .

[2] On an application of semi groups methods to some problems in coding , 1956, IRE Trans. Inf. Theory.

[3] Richard S. Marcus,et al. Full decodable code-word sets , 1959, IRE Trans. Inf. Theory.

[4] M. Schützenberger,et al. The equation $a^M=b^Nc^P$ in a free group. , 1962 .

[5] E. K. Blum. A note on free subsemigroups with two generators , 1965 .

[6] Matti Linna,et al. The decidability of the dol prefix problem , 1977 .

[7] Jean-François Perrot. Informationque et algébre la theorie des codes a longueur variable , 1977, Theoretical Computer Science.

[8] J. Taylor,et al. Switching and finite automata theory, 2nd ed. , 1980, Proceedings of the IEEE.