On lower bounds for the redundancy of optimal codes
type: Item
instance of: scholarly article
title: On lower bounds for the redundancy of optimal codes
zbMATH Open document ID: 0914.94005
DOI: 10.1023/A:1008273408148
author: Roberto De Prisco
author: Alfredo De Santis
published in: Designs, Codes and Cryptography
publication date: 1999-06-27T00:00:00Z
Mathematics Subject Classification ID: 94A29
zbMATH DE Number: 1230540
zbMATH Keywords: lower bounds
zbMATH Keywords: Huffman codes
zbMATH Keywords: redundancy
zbMATH Keywords: optimal codes
MaRDI profile type: Publication
full work available at URL: a:1008273408148
OpenAlex ID: W1555278369
Recommended article: On the redundancy of optimal codes with limited word length
Recommended article: Some Upper Bounds on the Redundancy of Optimal Binary Fix-Free Codes
Recommended article: On bounded redundancy of universal codes
Recommended article: On the minimal redundancy of binary error-correcting codes
Recommended article: Some Tight Lower Bounds on the Redundancy of Optimal Binary Prefix-Free and Fix-Free Codes
Recommended article: Methods of constructing lower bounds for redundancy of universal coding
Recommended article: Q3346218
Recommended article: A reduced upper bound on the error correction ability of codes (Corresp.)
Recommended article: On the redundancy of optimal binary prefix-condition codes for finite and infinite sources (Corresp.)
Recommended article: Bounds on the redundancy of binary alphabetical codes
description: scientific article; zbMATH DE number 1230540