Coding with variable block maps (Q861282): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2006.09.024 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2064228315 / rank | |||
Normal rank |
Revision as of 21:24, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Coding with variable block maps |
scientific article |
Statements
Coding with variable block maps (English)
0 references
9 January 2007
0 references
Let \(A\) be a finite alphabet and let \(A^+\), \(A^{\mathbb N}\) and \(A^{\mathbb Z}\) denote the set of finite, one-sided or two-sided infinite words over \(A\), respectively. By a pointed word is understood a finite word \(w\in A^+\) with a specified position, called the origin of \(w\), and a finite set \({\mathcal V}\) of pointed words, satisfying a certain condition is called a variable block map on \(A\). If \(B\) is another finite alphabet and \(X\subseteq B^+\cup B^{\mathbb N}\cup B^{\mathbb Z}\), the authors study the pair \([X,(L,O)]\), where \(L\) and \(O\) are functions from \(B\) to \(\mathbb N\) satisfying \(0\leq O(b)< L(b)\) for \(b\in B\). They introduce the notion of identifiability of the pair \([X,(L,O)]\) and establish the relation between this property and existence of a coding \(\Theta: {\mathcal V}\to B\), where \({\mathcal V}\) is a variable block map over an alphabet \(A\) and \(\Theta\) is a bijection.
0 references
symbolic sequence
0 references
prefix code
0 references
recoding
0 references