An enhanced property of factorizing codes

DOI10.1016/j.tcs.2005.03.022zbMath1079.68031OpenAlexW2002222919MaRDI QIDQ2484437

Clelia De Felice

Publication date: 1 August 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.03.022

zbMATH Keywords

Formal languagesFactorizations of cyclic groupsVariable length codes

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Prefix, length-variable, comma-free codes (94A45)

Related Items (4)

On factorizing codes: Structural properties and related decision problems ⋮ FINITE COMPLETIONS VIA FACTORIZING CODES ⋮ A note on the factorization conjecture ⋮ On a complete set of operations for factorizing codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An application of Hajós factorizations to variable-length codes
• On the factorization of codes
• Noncommutative factorization of variable-length codes
• Construction of a family of finite maximal codes
• 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
• Hajós factorizations and completion of codes.
• On some Schützenberger conjectures
• On the factorisation of finite abelian groups
• Completing codes
• ON A PROPERTY OF THE FACTORIZING CODES

This page was built for publication: An enhanced property of factorizing codes