SYNCHRONIZATION AND DECOMPOSABILITY FOR A FAMILY OF CODES (Q4029499)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 138972
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | SYNCHRONIZATION AND DECOMPOSABILITY FOR A FAMILY OF CODES |
scientific article; zbMATH DE number 138972 |
Statements
SYNCHRONIZATION AND DECOMPOSABILITY FOR A FAMILY OF CODES (English)
0 references
28 March 1993
0 references
degree
0 references
decomposition
0 references
variable-length codes
0 references
indecomposable codes
0 references
formal power series in noncommuting variables
0 references
multiple factorizations
0 references
factorization conjecture
0 references
0.902209222316742
0 references
0.902209222316742
0 references
0.8896528482437134
0 references
0.8190558552742004
0 references
0.7890782356262207
0 references
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.
0 references
