Hajós factorizations and completion of codes.
From MaRDI portal
Publication:1391133
DOI10.1016/S0304-3975(97)00032-7zbMath1053.20531WikidataQ114121087 ScholiaQ114121087MaRDI QIDQ1391133
Publication date: 22 July 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Finite abelian groups (20K01) Semigroups in automata theory, linguistics, etc. (20M35) Combinatorial codes (94B25)
Related Items (8)
On factorizing codes: Structural properties and related decision problems ⋮ FINITE COMPLETIONS VIA FACTORIZING CODES ⋮ An enhanced property of factorizing codes ⋮ Completing codes and the Rédei property of groups ⋮ A note on the factorization conjecture ⋮ Finite maximal codes and triangle conjecture ⋮ On a complete set of operations for factorizing codes ⋮ On some Schützenberger conjectures
Cites Work
- An application of Hajós factorizations to variable-length codes
- Construction of a family of finite maximal codes
- On codes having no finite completions
- On the factorisation of finite abelian groups
- Completing codes
- On the factorization conjecture
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Hajós factorizations and completion of codes.
