ON A PROPERTY OF THE FACTORIZING CODES
From MaRDI portal
Recommendations
Cites work
- A conjecture on continued fractions
- A conjecture on sets of differences of integer pairs
- A counterexample to the triangle conjecture
- A note on codes having no finite completions
- A partial result about the factorization conjecture for finite variable- length codes
- Completing codes
- Construction of a family of finite maximal codes
- On codes having no finite completions
- SYNCHRONIZATION AND DECOMPOSABILITY FOR A FAMILY OF CODES
- Synchronization and decomposability for a family of codes. II
- The shuffle algebra on the factors of a word is free
Cited in
(12)- Hajós factorizations and completion of codes.
- Some combinatorial results on Bernoulli sets and codes
- On some Schützenberger conjectures
- On factorizing codes: Structural properties and related decision problems
- An enhanced property of factorizing codes
- Completing codes and the Rédei property of groups
- scientific article; zbMATH DE number 1254094 (Why is no real title available?)
- FINITE COMPLETIONS VIA FACTORIZING CODES
- Finite maximal codes and factorizations of cyclic groups
- An application of Hajós factorizations to variable-length codes
- On the commutative equivalence of algebraic structures and related problems
- Factorizations of cyclic groups and bayonet codes
This page was built for publication: ON A PROPERTY OF THE FACTORIZING CODES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4513297)
