Variable-length codes independent or closed with respect to edit relations
From MaRDI portal
Publication:2084770
Recommendations
Cites work
- scientific article; zbMATH DE number 5643878 (Why is no real title available?)
- scientific article; zbMATH DE number 3720983 (Why is no real title available?)
- scientific article; zbMATH DE number 3528212 (Why is no real title available?)
- scientific article; zbMATH DE number 3569855 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 2176112 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 3240929 (Why is no real title available?)
- scientific article; zbMATH DE number 3397423 (Why is no real title available?)
- A Mathematical Theory of Communication
- A Method for the Construction of Minimum-Redundancy Codes
- A Survey of Combinatorial Gray Codes
- A universal algorithm for sequential data compression
- Codes and automata.
- Combinatorial Gray Codes
- Complete variable-length codes: an excursion into word edit operations
- Completing circular codes in regular submonoids
- Completing comma-free codes
- Completion of recognizable bifix codes
- Data compression and Gray-code sorting
- Each regular code is included in a maximal regular code
- Embedding a -invariant code into a complete one
- Error correction coding. Mathematical methods and algorithms
- Error detecting and error correcting codes
- Error-correction, and finite-delay decodability
- Error-detecting properties of languages
- Finite maximal solid codes
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
- Maximal bifix codes
- On Relations Defined by Generalized Finite Automata
- On codes having no finite completions
- On completion of codes with finite deciphering delay
- On the maximality of languages with combined types of code properties
- Relations on free monoids, their independent sets, and codes1
- Symbolic Gray Code As A Data Allocation Scheme For Two-disc Systems
- Synchronization
Cited in
(6)- Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions
- Topologies for error-detecting variable-length codes
- Complete variable-length codes: an excursion into word edit operations
- When variable-length codes meet the field of error detection
- Special issue: Selected papers of the 14th international conference on language and automata theory and applications, LATA 2020
- Gray cycles of maximum length related to \(k\)-character substitutions
This page was built for publication: Variable-length codes independent or closed with respect to edit relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2084770)
