On completion of codes with finite deciphering delay

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

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

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/s0195-6698(13)80036-4

zbMATH Keywords

prefix codescompletion of codesfinite deciphering delayfree submonoid

Mathematics Subject Classification ID

Semigroups in automata theory, linguistics, etc. (20M35) Prefix, length-variable, comma-free codes (94A45)

Related Items (19)

A completion algorithm for codes with bounded synchronization delay ⋮ Combinatorial properties of codes with degree \(n\) ⋮ When variable-length codes meet the field of error detection ⋮ Completing comma-free codes ⋮ Topologies for error-detecting variable-length codes ⋮ On codes having no finite completion ⋮ On maximal synchronous codes. ⋮ Completion of codes with finite bi-decoding delays. ⋮ Maximal codes with bounded deciphering delay ⋮ An application of Hajós factorizations to variable-length codes ⋮ Completing circular codes in regular submonoids ⋮ On codes with a finite deciphering delay: Constructing uncompletable words ⋮ Finite maximal solid codes ⋮ On maximal codes with bounded synchronization delay ⋮ FREE MONOID THEORY: MAXIMALITY AND COMPLETENESS IN ARBITRARY SUBMONOIDS ⋮ Variable-length codes independent or closed with respect to edit relations ⋮ On codes having no finite completion ⋮ On maximal codes with a finite interpreting delay. ⋮ Locally complete sets and finite decomposable codes

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

This page was built for publication: On completion of codes with finite deciphering delay