An application of Hajós factorizations to variable-length codes
From MaRDI portal
Publication:671432
DOI10.1016/0304-3975(95)00223-5zbMath0864.94014WikidataQ114214838 ScholiaQ114214838MaRDI QIDQ671432
Publication date: 27 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(95)00223-5
Related Items
FINITE COMPLETIONS VIA FACTORIZING CODES, Finite maximal codes and triangle conjecture, Abelian groups that cannot be factored without periodic factor., Hajós factorizations and completion of codes., On factorizing codes: Structural properties and related decision problems, An enhanced property of factorizing codes, Completing codes and the Rédei property of groups, A note on the factorization conjecture, On a complete set of operations for factorizing codes, QUASI-PERIODIC FACTORIZATIONS
Cites Work
- A three-word code which is not prefix-suffix composed
- Completion of recognizable bifix codes
- On completion of codes with finite deciphering delay
- A counterexample to the triangle conjecture
- Completing biprefix codes
- Noncommutative factorization of variable-length codes
- On a variation of Sands' method
- A conjecture on sets of differences of integer pairs
- On codes having no finite completions
- A partial result about the factorization conjecture for finite variable- length codes
- A note on codes having no finite completions
- On the factorisation of finite abelian groups
- THE FACTORIZATION OF ABELIAN GROUPS
- Each regular code is included in a maximal regular code
- Completing codes
- On codes having no finite completion
- On a conjecture of G. Hajós
- Sur certains sous-monoïdes libres
- Sur le problème de factorisation des groupes cycliques
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item