Extended synchronizing codewords for \(q\)-ary complete prefix codes (Q5937604): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127772004 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0012-365x(00)00333-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2054766825 / rank | |||
Normal rank | |||
Latest revision as of 10:23, 30 July 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
