Synchronizing codewords of \(q\)-ary Huffman codes
type: Item
instance of: scholarly article
title: Synchronizing codewords of \(q\)-ary Huffman codes
zbMATH Open document ID: 0968.94007
DOI: 10.1016/S0012-365X(99)90127-9
author: A. E. Escott
author: Stephanie Perkins
published in: Discrete Mathematics
publication date: 1999-09-29T00:00:00Z
Mathematics Subject Classification ID: 94A45
zbMATH DE Number: 1322044
zbMATH Keywords: variable length codes
zbMATH Keywords: Huffman codes
zbMATH Keywords: synchronizing codeword
zbMATH Keywords: good codes
MaRDI profile type: Publication
cites work: On the characterization of statistically synchronizable variable-length codes
cites work: On the construction of statistically synchronizable codes
cites work: Binary Huffman equivalent codes with a short synchronizing codeword
cites work: Self-synchronizing Huffman codes (Corresp.)
cites work: Codes with bounded synchronization delay
cites work: A Method for the Construction of Minimum-Redundancy Codes
cites work: Q5328541
cites work: Construction of minimum-redundance codes with an optimum synchronizing property
cites work: On the characterization of statistically synchronizable codes (Corresp.)
full work available at URL: s0012-365x(99)90127-9
OpenAlex ID: W4212845268
description: scientific article; zbMATH DE number 1322044