Completing comma-free codes
From MaRDI portal
Publication:1399997
DOI10.1016/S0304-3975(02)00595-9zbMATH Open1022.68059MaRDI QIDQ1399997FDOQ1399997
Publication date: 30 July 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The equation \(a_ M=b^ Nc^ P\) in a free group
- Comma-Free Codes
- Completion of recognizable bifix codes
- Automata accepting primitive words
- Each regular code is included in a maximal regular code
- On completion of codes with finite deciphering delay
- Completing biprefix codes
- Codes with bounded synchronization delay
- Regent Results in Comma-Free Codes
- Title not available (Why is that?)
Cited In (14)
- Variable-length codes independent or closed with respect to edit relations
- On the maximality of languages with combined types of code properties
- Finite Completion of comma-free codes Part 1
- Finite Completion of comma-free codes Part 2
- Automata for solid codes
- Title not available (Why is that?)
- Maximal dinucleotide comma-free codes
- Topologies for error-detecting variable-length codes
- Each regular code is included in a maximal regular code
- Completing codes
- The relation between \(k\)-circularity and circularity of codes
- Two-dimensional comma-free and cylindric codes
- Some properties of maximal comma-free codes
- When variable-length codes meet the field of error detection
This page was built for publication: Completing comma-free codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1399997)
