Completion of codes with finite bi-decoding delays

✍ Scribed by Liang Zhang; K.P. Shum; Shou-Li Peng

• Publisher: Elsevier Science
• Year: 2003
• Tongue: English
• Weight: 274 KB
• Volume: 306
• Category: Article
• ISSN: 0304-3975
• DOI: 10.1016/s0304-3975(03)00243-3

✦ Synopsis

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 biÿx codes and codes with ÿnite 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 ÿnite bi-decoding delays. As a consequence, the completion method of rational biÿx codes and codes with ÿnite decoding delays is extended and applied to codes with ÿnite bi-decoding delays.