A completion algorithm for codes with bounded synchronization delay
From MaRDI portal
Cites work
- A combinatorial property of codes having finite synchronization delay
- A General Method for Channel Coding
- A possible code in the genetic code
- Algorithms for sliding block codes - An application of symbolic dynamics to information theory
- An Introduction to Symbolic Dynamics and Coding
- Bisections reconnaissables
- Codes limites et factorisations finies du monoïde libre
- Codes with bounded synchronization delay
- Completing biprefix codes
- Completion of recognizable bifix codes
- Each regular code is included in a maximal regular code
- scientific article; zbMATH DE number 3943051 (Why is no real title available?)
- scientific article; zbMATH DE number 3760085 (Why is no real title available?)
- scientific article; zbMATH DE number 50943 (Why is no real title available?)
- scientific article; zbMATH DE number 512840 (Why is no real title available?)
- scientific article; zbMATH DE number 1988973 (Why is no real title available?)
- scientific article; zbMATH DE number 2102735 (Why is no real title available?)
- scientific article; zbMATH DE number 3316999 (Why is no real title available?)
- scientific article; zbMATH DE number 3373622 (Why is no real title available?)
- On a Factorisation of Free Monoids
- On a question of McNaughton and Papert
- On codes having no finite completion
- On codes having no finite completions
- On completion of codes with finite deciphering delay
- Precircular codes and periodic biinfinite words
- Surjective Extensions of Sliding-Block Codes
- The method of poles: a coding method for constrained channels
This page was built for publication: A completion algorithm for codes with bounded synchronization delay
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4571942)
