Codes and local constraints
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3978417 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 1988973 (Why is no real title available?)
- A General Method for Channel Coding
- A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup
- A combinatorial property of codes having finite synchronization delay
- Algorithms for sliding block codes - An application of symbolic dynamics to information theory
- Codes circulaires, automates locaux et entropie
- Construction of Bounded Delay Codes for Discrete Noiseless Channels
- On a question of McNaughton and Papert
- On synchronous variable length coding for discrete noiseless chrannels
- Sofic systems and encoding data
- State splitting for variable-length graphs (Corresp.)
- Systèmes codés. (Coded systems)
Cited in
(24)- Local classification of constraints
- A conjugacy invariant for reducible sofic shifts and its semigroup characterizations
- On a complete set of operations for factorizing codes
- scientific article; zbMATH DE number 4168387 (Why is no real title available?)
- scientific article; zbMATH DE number 3930882 (Why is no real title available?)
- Codes, unambiguous automata and sofic systems.
- Prefix-free languages as \(\omega\)-generators
- Finitely generated sofic systems
- Codes and sofic constraints
- On the maximality of languages with combined types of code properties
- Bifix codes and Sturmian words
- Codes of central Sturmian words
- Codes and maximal monoids
- Coding for locality in reconstructing permutations
- Constrained Codes as Networks of Relations
- On codes with local joint constraints
- Codes engendrant certains systèmes sofiques. (Codes generating certain sofic systems)
- Completing codes in a sofic shift
- Pseudo-cyclic renewal systems
- Codes circulaires, automates locaux et entropie
- Cyclic renewal systems
- Completing circular codes in regular submonoids
- Localisation-resistant random words with small alphabets
- Codes and automata in minimal sets
This page was built for publication: Codes and local constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q908715)
