A completion algorithm for codes with bounded synchronization delay
From MaRDI portal
Publication:4571942
DOI10.1007/3-540-63165-8_167zbMath1401.94127OpenAlexW1544343399MaRDI QIDQ4571942
Publication date: 4 July 2018
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-63165-8_167
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Completion of recognizable bifix codes
- On completion of codes with finite deciphering delay
- Completing biprefix codes
- On codes having no finite completions
- A combinatorial property of codes having finite synchronization delay
- Precircular codes and periodic biinfinite words
- The method of poles: a coding method for constrained channels
- Each regular code is included in a maximal regular code
- Codes limites et factorisations finies du monoïde libre
- Bisections reconnaissables
- A General Method for Channel Coding
- Algorithms for sliding block codes - An application of symbolic dynamics to information theory
- Surjective Extensions of Sliding-Block Codes
- On codes having no finite completion
- A possible code in the genetic code
- On a question of McNaughton and Papert
- An Introduction to Symbolic Dynamics and Coding
- Codes with bounded synchronization delay
- On a Factorisation of Free Monoids
This page was built for publication: A completion algorithm for codes with bounded synchronization delay
