Finite Completion of comma-free codes Part 1

DOI10.1051/ITA:2004006MaRDI QIDQ4825390zbMATH OpenOpenAlexFDO

Authors Nguyen Huong Lam

Publication date 28 October 2004

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

Full work available at URL http://www.numdam.org/item?id=ITA_2004__38_2_91_0, https://eudml.org/doc/92738

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Combinatorics on words (68R15)

Recommendations

• Finite Completion of comma-free codes Part 2
• Completing solid codes to maximal comma-free codes
• Completing comma-free codes
• Some properties of maximal comma-free codes
• scientific article; zbMATH DE number 4092795

Cites work

• scientific article; zbMATH DE number 3943051 (Why is no real title available?)
• scientific article; zbMATH DE number 50943 (Why is no real title available?)
• scientific article; zbMATH DE number 1948513 (Why is no real title available?)
• scientific article; zbMATH DE number 3247161 (Why is no real title available?)
• Comma-Free Codes
• Maximal and variable word-length comma-free codes
• On codes having no finite completions
• On the construction of comma-free codes
• Outfix and infix codes and related classes of languages
• Regent Results in Comma-Free Codes
• Some properties of maximal comma-free codes

Cited in

(15)

• scientific article; zbMATH DE number 1414301 (Why is no real title available?)
• scientific article; zbMATH DE number 7731171 (Why is no real title available?)
• Finite Completion of comma-free codes Part 2
• scientific article; zbMATH DE number 2114221 (Why is no real title available?)
• The Construction of Variable-length Comma-Free Codes
• Hall sets, Lazard sets and comma-free codes
• Completing solid codes to maximal comma-free codes
• Completing comma-free codes
• Properties of quasi-composition and completion of circular codes
• Two-dimensional comma-free and cylindric codes
• Combinatorial problems motivated by comma‐free codes
• scientific article; zbMATH DE number 3891253 (Why is no real title available?)
• Comma-free error-correcting codes
• Some properties of maximal comma-free codes
• Completing biprefix codes

This page was built for publication: Finite Completion of comma-free codes Part 1

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