On codes having no finite completion

DOI10.1051/ITA/1995290201451zbMath0819.94019OpenAlexW1536222145MaRDI QIDQ4763927

Nguyen Huong Lam

Publication date: 22 May 1995

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92500

zbMATH Keywords

variable length codesmaximal codebinary alphabetincompletable codes

Mathematics Subject Classification ID

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

Related Items (2)

An application of Hajós factorizations to variable-length codes ⋮ Finite maximal codes and triangle conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On completion of codes with finite deciphering delay
• Construction of a family of finite maximal codes
• On codes having no finite completions
• Each regular code is included in a maximal regular code
• Completing codes

This page was built for publication: On codes having no finite completion