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

decompositiondegreefactorization conjectureformal power series in noncommuting variablesindecomposable codesmultiple factorizationsvariable-length codes

Mathematics Subject Classification ID

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

Review text

This paper deals with the concepts of \textit{degree} and \textit{decomposition} for \textit{variable-length codes}. Roughly speaking, the degree is the number of decodings of a bi-infinite word and all codes are obtained by composition of some basic codes called indecomposable. The authors characterize the degree of \textit{\(3-\)codes}, which are finite maximal codes over the alphabet \(\{ a, b \}\) with at most \(3\) letters \(b\) inside their words, they also describe all the indecomposable codes inside this family. They developed some algebraic techniques based on formal power series in noncommuting variables. One of them is a characterization of codes with \textit{multiple factorizations}. The main motivation is the \textit{factorization conjecture} by M. P. Schützenberger.

Recommendations

• Degree and decomposability of variable-length codes
• 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)

• Combinatorial properties of codes with degree \(n\)
• On some Schützenberger conjectures
• 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
• On the construction of statistically synchronizable codes
• ON A PROPERTY OF THE FACTORIZING CODES
• Birecurrent sets
• Further results on the synchronization of binary cyclic codes (Corresp.)
• Finite maximal codes and factorizations of cyclic groups
• 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)