Topologies for error-detecting variable-length codes
From MaRDI portal
Publication:6186320
DOI10.1016/J.IC.2023.105092arXiv2309.01997OpenAlexW4386784795MaRDI QIDQ6186320
Publication date: 2 February 2024
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2309.01997
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Transductions des langages de Chomsky
- On codes having no finite completions
- Completing comma-free codes
- Finite maximal infix codes
- Distances between languages and reflexivity of relations
- Automata and rational expressions
- 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
- Error Detecting and Error Correcting Codes
- Some Investigations on Similarity Measures Based on Absent Words
- Theoretical Aspects of Computing – ICTAC 2005
- On Relations Defined by Generalized Finite Automata
- Finite maximal solid codes
- When variable-length codes meet the field of error detection
This page was built for publication: Topologies for error-detecting variable-length codes
