When variable-length codes meet the field of error detection
From MaRDI portal
Publication:6108733
DOI10.1007/978-3-031-19685-0_15arXiv2208.14681OpenAlexW4294015549MaRDI QIDQ6108733
Publication date: 26 July 2023
Published in: Algebraic Informatics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2208.14681
automorphismembeddingmetricanti-automorphismdistancemeasurehomomorphismchannelbinary relationerror detectioncodefactorindependentprefixregularerror correctioncompletemonoidautomatonmaximalBernoulli measurefree monoidquasi-metricwordsubsequencestransducercodewordvariable-length codeKraft inequalitysuffixsynchronization constraintinput wordanti-reflexiveoutput word
Related Items (2)
Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions ⋮ Topologies for error-detecting variable-length codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the maximality of languages with combined types of code properties
- Completion of recognizable bifix codes
- On completion of codes with finite deciphering delay
- On codes having no finite completions
- Completing comma-free codes
- Finite maximal infix codes
- Distances between languages and reflexivity of relations
- Variable-length codes independent or closed with respect to edit relations
- Embedding a \(\theta \)-invariant code into a complete one
- Completing circular codes in regular submonoids
- Prefix Distance Between Regular Languages
- An Overview of Sequence Comparison: Time Warps, String Edits, and Macromolecules
- Each regular code is included in a maximal regular code
- On Quasi-Metric Spaces
- Error Detecting and Error Correcting Codes
- Theoretical Aspects of Computing – ICTAC 2005
- On Relations Defined by Generalized Finite Automata
- Finite maximal solid codes
This page was built for publication: When variable-length codes meet the field of error detection
