Synchronization and decomposability for a family of codes. II (Q1893165): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0012-365x(94)e0138-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2157071601 / rank | |||
Normal rank | |||
Latest revision as of 08:40, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Synchronization and decomposability for a family of codes. II |
scientific article |
Statements
Synchronization and decomposability for a family of codes. II (English)
0 references
24 July 1996
0 references
The main result is that, for any variable length code \(C\) on a two letter alphabet \(\{a, b\}\), such that \(C\) is maximal and finite and has at most 3 occurrences of \(b\) in each of its elements, \(C\) has always one or two factorizations; if \(C\) has degree 1, it has one factorization; if \(C\) has degree 2 or 3 it has two factorizations and they may be deduced from the precise form of \(C\) given by the authors, which is related to Krasner factorizations.
0 references
variable length code
0 references
factorizations
0 references
