On a complete set of operations for factorizing codes
From MaRDI portal
Publication:3374755
DOI10.1051/ita:2005040zbMath1091.94017MaRDI QIDQ3374755
Publication date: 22 February 2006
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=ITA_2006__40_1_29_0
94A45: Prefix, length-variable, comma-free codes
Related Items
FINITE COMPLETIONS VIA FACTORIZING CODES, On factorizing codes: Structural properties and related decision problems, A note on the factorization conjecture
Cites Work
- A three-word code which is not prefix-suffix composed
- An application of Hajós factorizations to variable-length codes
- On the factorization of codes
- Codes and local constraints
- Noncommutative factorization of variable-length codes
- Construction of a family of finite maximal codes
- 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
- Hajós factorizations and completion of codes.
- Locally complete sets and finite decomposable codes
- On the lattice of prefix codes.
- On some Schützenberger conjectures
- A non-ambiguous decomposition of regular languages and factorizing codes
- Synchronization and decomposability for a family of codes. II
- An enhanced property of factorizing codes
- On the factorisation of finite abelian groups
- Completing codes
- SYNCHRONIZATION AND DECOMPOSABILITY FOR A FAMILY OF CODES
- Codes asynchrones
- Une famille remarquable de codes indecomposables
- Sur un algorithme donnant les codes bipréfixes finis
- 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
