Robust universal complete codes for transmission and compression
type: Item
instance of: scholarly article
title: Robust universal complete codes for transmission and compression
zbMATH Open document ID: 0874.94026
DOI: 10.1016/0166-218X(93)00116-H
author: Aviezri S. Fraenkel
author: Shmuel T. Klein
published in: Discrete Applied Mathematics
publication date: 1996-07-07T00:00:00Z
full work available at URL: dam
Mathematics Subject Classification ID: 94A45
Mathematics Subject Classification ID: 11B39
zbMATH DE Number: 897352
zbMATH Keywords: measures
zbMATH Keywords: variable-length codewords
zbMATH Keywords: Huffman codes
MaRDI profile type: Publication
Wikidata QID: Q56083295
cites work: Robust transmission of unbounded strings using Fibonacci representations
cites work: Q4430300
cites work: Is Huffmann coding dead?
cites work: Universal codeword sets and representations of the integers
cites work: Economical encoding of commas between strings
cites work: Self-synchronizing Huffman codes (Corresp.)
cites work: Systems of Numeration
cites work: The use and usefulness of numeration systems
cites work: Maximal Prefix-Synchronized Codes
cites work: Q4520888
cites work: Q3926079
cites work: A Method for the Construction of Minimum-Redundancy Codes
cites work: Huffman coding in bit-vector compression
cites work: Regent Results in Comma-Free Codes
cites work: Fibonacci codes for synchronization control
cites work: Data compression
cites work: Two inequalities implied by unique decipherability
cites work: Q5665234
cites work: A universal algorithm for sequential data compression
cites work: Compression of individual sequences via variable-rate coding
OpenAlex ID: W2069056415
DBLP publication ID: journals/dam/FraenkelK96
description: scientific article; zbMATH DE number 897352