Completion of codes with finite bi-decoding delays.

DOI10.1016/S0304-3975(03)00243-3MaRDI QIDQ1426443zbMATH OpenFDO

Authors Liang Zhang, K. P. Shum, Shou-Li Peng

Publication date 14 March 2004

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

Full work available at URL https://doi.org/10.1016/S0304-3975(03)00243-3

zbMATH Keywords

Codes with finite decoding delayFree monoidsPrefix languagesSuffix languages

Mathematics Subject Classification ID

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

Recommendations

• On completion of codes with finite deciphering delay
• scientific article; zbMATH DE number 4092795
• On codes having no finite completions
• Completion of recognizable bifix codes
• Completing biprefix codes

Cites work

• Completion of recognizable bifix codes
• scientific article; zbMATH DE number 3763326 (Why is no real title available?)
• scientific article; zbMATH DE number 1988973 (Why is no real title available?)
• scientific article; zbMATH DE number 2102735 (Why is no real title available?)
• Maximal bifix codes
• On a question concerning certain free submonoids
• On completion of codes with finite deciphering delay

Cited in

(8)

• The completion of very thin prefix codes with degree n
• scientific article; zbMATH DE number 3950378 (Why is no real title available?)
• A generalization of Girod's bidirectional decoding method to codes with a finite deciphering delay
• A profinite approach to complete bifix decodings of recurrent languages
• Completion of recognizable bifix codes
• Three-word codes \(\{a,aba,u\}\) having a finite completion
• Three-word codes \(\{a, aba, u\}\) and \(\{a, ab, v\}\) having finite completions
• On completion of codes with finite deciphering delay

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1426443)