On the redundancy achieved by Huffman codes
type: Item
instance of: scholarly article
title: On the redundancy achieved by Huffman codes
zbMATH Open document ID: 0874.94020
DOI: 10.1016/0020-0255(95)00220-0
author: Roberto De Prisco
author: Alfredo De Santis
published in: Information Sciences
publication date: 1997-09-04T00:00:00Z
Mathematics Subject Classification ID: 94A29
zbMATH DE Number: 1057120
zbMATH Keywords: Huffman codes
zbMATH Keywords: redundancy
zbMATH Keywords: discrete memoryless source
MaRDI profile type: Publication
full work available at URL: 0020-0255(95)00220-0
OpenAlex ID: W1510013050
cites work: Tight upper bounds on the redundancy of Huffman codes
cites work: New bounds on the redundancy of Huffman codes
cites work: Bounds on the redundancy of Huffman codes (Corresp.)
cites work: Variations on a theme by Huffman
cites work: An improved bound for weight-balanced tree
cites work: A Method for the Construction of Minimum-Redundancy Codes
cites work: On the redundancy of binary Huffman codes (Corresp.)
cites work: Huffman codes and self-information
cites work: Tight bounds on the redundancy of Huffman codes
cites work: On the redundancy of optimal binary prefix-condition codes for finite and infinite sources (Corresp.)
cites work: On the average codeword length of optimal binary codes for extended sources (Corresp.)
cites work: Q3358644
description: scientific article; zbMATH DE number 1057120