Finite maximal solid codes
From MaRDI portal
Recommendations
Cites work
- Completing biprefix codes
- Completion of recognizable bifix codes
- Each regular code is included in a maximal regular code
- scientific article; zbMATH DE number 50943 (Why is no real title available?)
- scientific article; zbMATH DE number 3480478 (Why is no real title available?)
- scientific article; zbMATH DE number 522835 (Why is no real title available?)
- scientific article; zbMATH DE number 1988973 (Why is no real title available?)
- scientific article; zbMATH DE number 3361792 (Why is no real title available?)
- scientific article; zbMATH DE number 4185539 (Why is no real title available?)
- Maximal solid codes
- On completion of codes with finite deciphering delay
- Solid codes and disjunctive domains
- Sur un algorithme donnant les codes bipréfixes finis
Cited in
(14)- Error-detecting properties of languages
- Variable-length codes independent or closed with respect to edit relations
- Automata for solid codes
- Solid codes and the uniform density of fd-domains.
- Maximal solid codes
- Formal descriptions of code properties: decidability, complexity, implementation
- Overlap-free languages and solid codes
- scientific article; zbMATH DE number 2143014 (Why is no real title available?)
- scientific article; zbMATH DE number 4185539 (Why is no real title available?)
- When variable-length codes meet the field of error detection
- Topologies for error-detecting variable-length codes
- On the maximum size of variable-length non-overlapping codes
- The applications of solid codes to r-R and r-D languages
- Synchronization
This page was built for publication: Finite maximal solid codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5958127)