Completion of codes with finite bi-decoding delays

Authors:
Liang Zhang;K. P. Shum;Shou-Li Peng
Affiliations:
Department of Applied Mathematics, Tongji University, Shanghai, China;Faculty of Science, The Chinese University of Hong Kong, Shatin NT, Hong Kong, China (SAR);Center for Non-linear Complex Systems, Yunnan University, China
Venue:
Theoretical Computer Science
Year:
2003

Citing 7
Cited 0

On completion of codes with finite deciphering delay

European Journal of Combinatorics
Completion of recognizable bifix codes

Theoretical Computer Science
Maximal bifix codes

Theoretical Computer Science
Generalized prefix relations and codes with finite decoding delay

Journal of Automata, Languages and Combinatorics
Theory of Codes

Theory of Codes
Variable-Length Maximal Codes

ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Completing Biprefix Codes

Proceedings of the 9th Colloquium on Automata, Languages and Programming

Quantified Score

Hi-index	5.23

Visualization

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.