SYNCHRONIZATION AND DECOMPOSABILITY FOR A FAMILY OF CODES

DOI10.1142/S0218196792000232MaRDI QIDQ4029499zbMATH OpenOpenAlexFDO

Authors Véronique Bruyère, Clelia De Felice

Publication date 28 March 1993

Published in International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218196792000232

zbMATH Keywords

decompositiondegreevariable-length codesindecomposable codesmultiple factorizationsfactorization conjectureformal power series in noncommuting variables

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Prefix, length-variable, comma-free codes (94A45)

Recommendations

• scientific article; zbMATH DE number 176765
• On the factorization of codes
• Synchronization and decomposability for a family of codes. II
• A partial result about the factorization conjecture for finite variable- length codes
• On the factorization conjecture

Cited in

(11)

• Finite maximal codes and factorizations of cyclic groups
• On the construction of statistically synchronizable codes
• On a complete set of operations for factorizing codes
• Birecurrent sets
• Combinatorial properties of codes with degree \(n\)
• On factorizing codes: Structural properties and related decision problems
• Further results on the synchronization of binary cyclic codes (Corresp.)
• Synchronization and decomposability for a family of codes. II
• On some Schützenberger conjectures
• ON A PROPERTY OF THE FACTORIZING CODES
• Finite maximal codes and triangle conjecture

This page was built for publication: SYNCHRONIZATION AND DECOMPOSABILITY FOR A FAMILY OF CODES

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4029499)