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.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call