Extended synchronizing codewords for \(q\)-ary complete prefix codes (Q5937604): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 00:43, 5 March 2024
scientific article; zbMATH DE number 1619855
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Extended synchronizing codewords for \(q\)-ary complete prefix codes |
scientific article; zbMATH DE number 1619855 |
Statements
Extended synchronizing codewords for \(q\)-ary complete prefix codes (English)
0 references
24 August 2002
0 references
This paper extends the results of \textit{W. M. Lam} and \textit{S. R. Kulkarni} [IEEE Trans. Inf. Theory 42, 984-987 (1996; Zbl 0860.94021)] that considered making the longest codeword of a binary prefix code into an extended synchronizing codeword (ESC). Lam and Kulkarni's method gives some upper bounds on the amount of overhead needed to design a prefix code with an ESC. This paper establishes lower bounds on the length of an ESC and provides an algorithm achieving these bounds.
0 references
synchronization
0 references
variable length codes
0 references
complete prefix codes
0 references
trees
0 references
