A short note on the redundancy of degree \(\alpha\) (Q1084075)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A short note on the redundancy of degree \(\alpha\) |
scientific article; zbMATH DE number 3976929
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A short note on the redundancy of degree \(\alpha\) |
scientific article; zbMATH DE number 3976929 |
Statements
A short note on the redundancy of degree \(\alpha\) (English)
0 references
1986
0 references
It is known that there always exists an instantaneous, uniquely decodable code such that the redundancy of the discrete source is bounded between 0 and 1. \textit{O. Johnsen} [IEEE Trans. Inf. Theory IT-26, 220-222 (1980; Zbl 0431.94025)] provided sharper bounds on the redundancy by making assumptions on the most likely source letter. In this paper we have obtained bounds on the redundancy of degree \(\alpha\) by applying Johnsen's approach.
0 references
discrete source
0 references
bounds on the redundancy
0 references
0 references
0 references
0.83167166
0 references
0.8300576
0 references
0.81865406
0 references
