SYNCHRONIZATION AND DECOMPOSABILITY FOR A FAMILY OF CODES

DOI10.1142/S0218196792000232zbMATH Open0763.94004OpenAlexW2025586931MaRDI QIDQ4029499FDOQ4029499

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

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

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)

Cited In (11)

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

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)