On a complete set of operations for factorizing codes
From MaRDI portal
Publication:3374755
Recommendations
Cites work
- A non-ambiguous decomposition of regular languages and factorizing codes
- A non-ambiguous language factorization problem
- A note on codes having no finite completions
- A partial result about the factorization conjecture for finite variable- length codes
- A three-word code which is not prefix-suffix composed
- An application of Hajós factorizations to variable-length codes
- An enhanced property of factorizing codes
- Codes and local constraints
- Codes asynchrones
- Completing codes
- Construction of a family of finite maximal codes
- Hajós factorizations and completion of codes.
- scientific article; zbMATH DE number 3162956 (Why is no real title available?)
- scientific article; zbMATH DE number 3905865 (Why is no real title available?)
- scientific article; zbMATH DE number 3926268 (Why is no real title available?)
- 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 41838 (Why is no real title available?)
- scientific article; zbMATH DE number 3529706 (Why is no real title available?)
- scientific article; zbMATH DE number 1047958 (Why is no real title available?)
- scientific article; zbMATH DE number 1988973 (Why is no real title available?)
- scientific article; zbMATH DE number 1759416 (Why is no real title available?)
- scientific article; zbMATH DE number 3999313 (Why is no real title available?)
- scientific article; zbMATH DE number 2102735 (Why is no real title available?)
- scientific article; zbMATH DE number 3332047 (Why is no real title available?)
- scientific article; zbMATH DE number 3024723 (Why is no real title available?)
- scientific article; zbMATH DE number 3058897 (Why is no real title available?)
- Locally complete sets and finite decomposable codes
- Noncommutative factorization of variable-length codes
- On codes having no finite completions
- On some Schützenberger conjectures
- On the factorisation of finite abelian groups
- On the factorization of codes
- On the lattice of prefix codes.
- Sur un algorithme donnant les codes bipréfixes finis
- SYNCHRONIZATION AND DECOMPOSABILITY FOR A FAMILY OF CODES
- Synchronization and decomposability for a family of codes. II
- Une famille remarquable de codes indecomposables
Cited in
(7)- Hajós factorizations and completion of codes.
- On factorizing codes: Structural properties and related decision problems
- A note on the factorization conjecture
- scientific article; zbMATH DE number 1740158 (Why is no real title available?)
- scientific article; zbMATH DE number 1759416 (Why is no real title available?)
- FINITE COMPLETIONS VIA FACTORIZING CODES
- Finite maximal codes and factorizations of cyclic groups
This page was built for publication: On a complete set of operations for factorizing codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3374755)