Completion of codes with finite bi-decoding delays.

DOI10.1016/S0304-3975(03)00243-3zbMath1070.68080MaRDI QIDQ1426443

Liang Zhang, Kar Ping Shum, Shou-Li Peng

Publication date: 14 March 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Free monoidsCodes with finite decoding delayPrefix languagesSuffix languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Prefix, length-variable, comma-free codes (94A45)

Cites Work

• Completion of recognizable bifix codes
• On completion of codes with finite deciphering delay
• Maximal bifix codes
• On a question concerning certain free submonoids
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Completion of codes with finite bi-decoding delays.