Completing comma-free codes

DOI10.1016/S0304-3975(02)00595-9zbMath1022.68059MaRDI QIDQ1399997

Nguyen Huong Lam

Publication date: 30 July 2003

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

zbMATH Keywords

completioncomma-free codesregular maximal comma-free codes

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (8)

Maximal dinucleotide comma-free codes ⋮ On the maximality of languages with combined types of code properties ⋮ When variable-length codes meet the field of error detection ⋮ The relation between \(k\)-circularity and circularity of codes ⋮ Topologies for error-detecting variable-length codes ⋮ Automata for solid codes ⋮ Two-dimensional comma-free and cylindric codes ⋮ Variable-length codes independent or closed with respect to edit relations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Completion of recognizable bifix codes
• On completion of codes with finite deciphering delay
• The equation \(a_ M=b^ Nc^ P\) in a free group
• Completing biprefix codes
• Automata accepting primitive words
• Comma-Free Codes
• Each regular code is included in a maximal regular code
• Regent Results in Comma-Free Codes
• Codes with bounded synchronization delay

This page was built for publication: Completing comma-free codes