A short note on the redundancy of degree \(\alpha\)
type: Item
instance of: scholarly article
title: A short note on the redundancy of degree \(\alpha\)
zbMATH Open document ID: 0604.94006
DOI: 10.1016/0020-0255(86)90036-8
author: Inder J. Taneja
published in: Information Sciences
publication date: 1986-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 94A29
zbMATH DE Number: 3976929
zbMATH Keywords: discrete source
zbMATH Keywords: bounds on the redundancy
MaRDI profile type: Publication
full work available at URL: 0020-0255(86)90036-8
OpenAlex ID: W1971227606
cites work: Q5516510
cites work: Q5564905
cites work: A Method for the Construction of Minimum-Redundancy Codes
cites work: On the redundancy of binary Huffman codes (Corresp.)
cites work: Conditions for Optimality of the Huffman Algorithm
cites work: Q3695172
Recommended article: Some new natural α-re-degrees
Recommended article: Remarks on the degree theory
Recommended article: Q4837850
Recommended article: The degree structure of Weihrauch-reducibility
Recommended article: A note on \(\alpha\)-redundant vertices in graphs
Recommended article: Q4313179
Recommended article: Minimalα-hyperdegrees
Recommended article: Q3779535
Recommended article: Maximality and collapse in the hierarchy of α-c.a. degrees
Recommended article: Q5689284
description: scientific article; zbMATH DE number 3976929