An enhanced property of factorizing codes

DOI10.1016/j.tcs.2005.03.022zbMath1079.68031MaRDI 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 languages; Factorizations of cyclic groups; Variable length codes

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68Q70: Algebraic theory of languages and automata

68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)

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, On a complete set of operations for factorizing codes

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item