On factorizing codes: Structural properties and related decision problems

DOI10.1016/j.aam.2005.12.002zbMath1115.68081MaRDI QIDQ2370827

Clelia De Felice

Publication date: 29 June 2007

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aam.2005.12.002

zbMATH Keywords

formal languages; variable-length codes; factorizing 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, A note on the factorization conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• 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.
• 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
• On a complete set of operations for factorizing codes
• Completing codes
• SYNCHRONIZATION AND DECOMPOSABILITY FOR A FAMILY OF CODES
• Une famille remarquable de codes indecomposables
• ON A PROPERTY OF THE FACTORIZING CODES