Name
Abstract | ||
|---|---|---|
Let A¿ be a free monoid generated by a set A and let X¿A¿ be a code with property P. The embedding of X into a complete code Y¿A¿ with the same property P is called the completion of X. The method of completion of rational bifix codes and codes with finite decoding delays have been investigated by a number of authors. In this paper, we provide a general method of construction for completing the codes with finite bi-decoding delays. As a consequence, the completion method of rational bifix codes and codes with finite decoding delays is extended and applied to codes with finite bi-decoding delays. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1016/S0304-3975(03)00243-3 | Theor. Comput. Sci. |
Keywords | DocType | Volume |
property p.,rational bifix code,free monoids,finite decoding delay,complete code y,general method,prefix languages,suffix languages,set a,finite bi-decoding delay,94a45,completion method,codes with finite decoding delay,free monoid,property p | Journal | 306 |
Issue | ISSN | Citations |
1 | Theoretical Computer Science | 0 |
PageRank | References | Authors |
0.34 | 6 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Liang Zhang | 1 | 1 | 1.16 |
| K. P. Shum | 2 | 82 | 11.08 |
| Shou-Li Peng | 3 | 1 | 1.50 |