Uniformly synchronous codes (Q1209281)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Uniformly synchronous codes |
scientific article |
Statements
Uniformly synchronous codes (English)
0 references
16 May 1993
0 references
Various relationships between synchronization and limitedness properties are investigated for prefix and biprefix codes. The prefix codes \(X\) over an alphabet \(A\) which are uniformly synchronous are characterized as the limited codes such that the \(F\)-\(d\) condition holds (i.e., codes with \(A^ +X^ dA^ +\cap X=\emptyset\)) for some natural number \(d\). A biprefix code of synchronization delay \(n\) is \((p,q)\)-limited with \(p+q=2n+1\). A biprefix code with the \(F\)-\(1\) condition has synchronization delay \(n\) if and only if it is \((2n+1,0)\)-limited but not \((2n-1,0)\)-limited. A code is a maximal prefix code with synchronization delay \(n\) if and only if the code is \(n\)-synchronous but not \((n-1)\)- synchronous. While 1-synchronous codes are known to be semaphore codes, an example is given to show that 2-synchronous codes are not necessarily semaphore codes. The 2-synchronous semaphore codes are characterized and necessary and sufficient conditions are also given for a semaphore code to be \(n\)-synchronous for an arbitrary \(n\).
0 references
biprefix codes
0 references
prefix codes
0 references
limited codes
0 references
synchronization delay
0 references
maximal prefix code
0 references
semaphore codes
0 references
2-synchronous codes
0 references