Finite maximal codes and factorizations of cyclic groups
From MaRDI portal
Publication:6621947
Publication date: 21 October 2024
Published in: Journal of Automata, Languages and Combinatorics (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An application of Hajós factorizations to variable-length codes
- Finite maximal codes and triangle conjecture
- A counterexample to the triangle conjecture
- On the factorization of codes
- Noncommutative factorization of variable-length codes
- Construction of a family of finite maximal codes
- A family of codes commutatively equivalent to prefix codes
- A conjecture on sets of differences of integer pairs
- A note on the triangle conjecture
- Baionnettes et cardinaux
- On the triangle conjecture
- On codes having no finite completions
- A partial result about the factorization conjecture for finite variable- length codes
- Hajós factorizations and completion of codes.
- On some Schützenberger conjectures
- Supplemented results of finite maximal codes related to the triangle conjecture proposed by D. Perrin and M. P. Schützenbeger
- A note with computer exploration on the triangle conjecture
- On factorizing codes: Structural properties and related decision problems
- An enhanced property of factorizing codes
- A note on the factorization conjecture
- On the factorisation of finite abelian groups
- On a complete set of operations for factorizing codes
- SYNCHRONIZATION AND DECOMPOSABILITY FOR A FAMILY OF CODES
- Une famille remarquable de codes indecomposables
- ON A PROPERTY OF THE FACTORIZING CODES
- On the synchronizing properties of certain prefix codes
This page was built for publication: Finite maximal codes and factorizations of cyclic groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6621947)