On completion of codes with finite deciphering delay

DOI10.1016/S0195-6698(13)80036-4zbMath0722.94006MaRDI QIDQ757324

Véronique Bruyère, Liang Zhang, Li-Min Wang

Publication date: 1990

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

prefix codes; completion of codes; finite deciphering delay; free submonoid

Mathematics Subject Classification ID

20M35: Semigroups in automata theory, linguistics, etc.

94A45: Prefix, length-variable, comma-free codes

Related Items

On codes having no finite completion, FREE MONOID THEORY: MAXIMALITY AND COMPLETENESS IN ARBITRARY SUBMONOIDS, On codes having no finite completion, On codes with a finite deciphering delay: Constructing uncompletable words, Finite maximal solid codes, An application of Hajós factorizations to variable-length codes, Maximal codes with bounded deciphering delay, On maximal codes with bounded synchronization delay, Combinatorial properties of codes with degree \(n\), Completing comma-free codes, On maximal synchronous codes., Completion of codes with finite bi-decoding delays., On maximal codes with a finite interpreting delay., Locally complete sets and finite decomposable codes, Completing circular codes in regular submonoids

Cites Work

• On codes having no finite completions
• Each regular code is included in a maximal regular code
• On a question concerning certain free submonoids
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item