Variable-length codes independent or closed with respect to edit relations
From MaRDI portal
Publication:2084770
DOI10.1016/j.ic.2021.104747OpenAlexW3157844820MaRDI QIDQ2084770
Publication date: 13 October 2022
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.14185
embeddingmetricsynchronizationdecodingchannelcodeindependentprefixregularstringBernoullicompleteerrorsolidsubstitutiondependencemaximaldeletioninsertionsubwordwordclosedsubstringeditionbifixedit relationGrayHammingLevenshteinvariable-lengthword relation
Related Items (5)
Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions ⋮ When variable-length codes meet the field of error detection ⋮ Topologies for error-detecting variable-length codes ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- On the maximality of languages with combined types of code properties
- Completion of recognizable bifix codes
- On completion of codes with finite deciphering delay
- Complete variable-length codes: an excursion into word edit operations
- Synchronization
- Data compression and Gray-code sorting
- On codes having no finite completions
- Maximal bifix codes
- Completing comma-free codes
- Error-detecting properties of languages
- Embedding a \(\theta \)-invariant code into a complete one
- Completing circular codes in regular submonoids
- Each regular code is included in a maximal regular code
- Combinatorial Gray Codes
- Relations on free monoids, their independent sets, and codes1
- Symbolic Gray Code As A Data Allocation Scheme For Two-disc Systems
- A universal algorithm for sequential data compression
- A Survey of Combinatorial Gray Codes
- Error Detecting and Error Correcting Codes
- Error Correction Coding
- On Relations Defined by Generalized Finite Automata
- A Method for the Construction of Minimum-Redundancy Codes
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
- Finite maximal solid codes
This page was built for publication: Variable-length codes independent or closed with respect to edit relations
