On the public citation graph

Tight upper bounds on the redundancy of Huffman codes

0 signed · 47 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1109/jrproc.1952.273898openalex-snapshot
A Method for the Construction of Minimum-Redundancy Codes
inferredcites →https://doi.org/10.1109/tit.1978.1055959openalex-snapshot
Variations on a theme by Huffman
inferredcites →https://doi.org/10.1109/tit.1980.1056158openalex-snapshot
On the redundancy of binary Huffman codes (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1986.1057239openalex-snapshot
Bounds on the redundancy of Huffman codes (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1987.1057266openalex-snapshot
On the redundancy of optimal binary prefix-condition codes for finite and infinite sources (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1987.1057280openalex-snapshot
On the average codeword length of optimal binary codes for extended sources (Corresp.)

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-54303-1_142openalex-snapshot
Minimum codeword length and redundancy of Huffman codes
inferred← citeshttps://doi.org/10.1007/978-1-4615-3596-6_8openalex-snapshot
Variations on a Theme by Gallager
inferred← citeshttps://doi.org/10.1007/978-3-031-82014-4_7openalex-snapshot
Old and New Results on Alphabetic Codes
inferred← citeshttps://doi.org/10.1016/0020-0255(95)00220-0openalex-snapshot
On the redundancy achieved by Huffman codes
inferred← citeshttps://doi.org/10.1016/b978-0-12-374449-4.00011-8openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/b978-0-12-374449-4.00014-3openalex-snapshot
Format of 802.11 Packets
inferred← citeshttps://doi.org/10.1016/b978-012443895-8/50009-xopenalex-snapshot
Data Compression
inferred← citeshttps://doi.org/10.1023/a:1008273408148openalex-snapshot
On Lower Bounds for the Redundancy of Optimal Codes
inferred← citeshttps://doi.org/10.1093/comjnl/41.3.137openalex-snapshot
On the Data Expansion of the Huffman Compression Algorithm
inferred← citeshttps://doi.org/10.1109/18.108260openalex-snapshot
Tight bounds on the redundancy of Huffman codes
inferred← citeshttps://doi.org/10.1109/18.119701openalex-snapshot
On the redundancy of optimal codes with limited word length
inferred← citeshttps://doi.org/10.1109/18.335933openalex-snapshot
Binary prefix codes ending in a "1"
inferred← citeshttps://doi.org/10.1109/18.61134openalex-snapshot
A note on D-ary Huffman codes
inferred← citeshttps://doi.org/10.1109/18.641572openalex-snapshot
A new bound for the data expansion of Huffman codes
inferred← citeshttps://doi.org/10.1109/18.87001openalex-snapshot
New bounds on the redundancy of Huffman codes
inferred← citeshttps://doi.org/10.1109/18.887856openalex-snapshot
Asymptotic average redundancy of Huffman (and other) block codes
inferred← citeshttps://doi.org/10.1109/18.904513openalex-snapshot
Some basic properties of fix-free codes
inferred← citeshttps://doi.org/10.1109/18.904514openalex-snapshot
On-line adaptive canonical prefix coding with bounded compression loss
inferred← citeshttps://doi.org/10.1109/69.591454openalex-snapshot
Text compression for dynamic document databases
inferred← citeshttps://doi.org/10.1109/access.2019.2932206openalex-snapshot
Lower Bounds on the Redundancy of Huffman Codes With Known and Unknown Probabilities
inferred← citeshttps://doi.org/10.1109/dcc.1994.305916openalex-snapshot
On the redundancy of optimum fixed-to-variable length codes
inferred← citeshttps://doi.org/10.1109/dcc.1995.515508openalex-snapshot
An efficient variable length coding scheme for an IID source
inferred← citeshttps://doi.org/10.1109/dcc.1995.515510openalex-snapshot
Arithmetic coding revisited
inferred← citeshttps://doi.org/10.1109/dcc.2008.103openalex-snapshot
On Precision-Redundancy Relation in the Design of Source Coding Algorithms
inferred← citeshttps://doi.org/10.1109/isit.2000.866668openalex-snapshot
Asymptotic average redundancy of Huffman (and Shannon-Fano) block codes
inferred← citeshttps://doi.org/10.1109/isit.2001.936081openalex-snapshot
Improving Gallager's upper bound on Huffman codes redundancy
inferred← citeshttps://doi.org/10.1109/isit.2006.262027openalex-snapshot
Rényi to Rényi ¿ Source Coding under Siege
inferred← citeshttps://doi.org/10.1109/isit.2008.4595328openalex-snapshot
Tight bounds on minimum maximum pointwise redundancy
inferred← citeshttps://doi.org/10.1109/isit.2016.7541050openalex-snapshot
Tight upper bounds on the redundancy of optimal binary AIFV codes
inferred← citeshttps://doi.org/10.1109/itw.2006.1633796openalex-snapshot
Tight Bounds on the Redundancy of Huffman Codes
inferred← citeshttps://doi.org/10.1109/sequen.1997.666911openalex-snapshot
Code and parse trees for lossless source encoding
inferred← citeshttps://doi.org/10.1109/tit.2002.1013158openalex-snapshot
A simple upper bound on the redundancy of Huffman codes
inferred← citeshttps://doi.org/10.1109/tit.2011.2110670openalex-snapshot
Redundancy-Related Bounds for Generalized Huffman Codes
inferred← citeshttps://doi.org/10.1109/tit.2011.2145590openalex-snapshot
Minimum Expected Length of Fixed-to-Variable Lossless Compression Without Prefix Constraints
inferred← citeshttps://doi.org/10.1109/tit.2012.2208580openalex-snapshot
Tight Bounds on the Redundancy of Huffman Codes\hbox{ H }\hbox{ H }
inferred← citeshttps://doi.org/10.1109/tit.2013.2294832openalex-snapshot
Huffman Redundancy for Large Alphabet Sources
inferred← citeshttps://doi.org/10.1109/tit.2017.2694017openalex-snapshot
Worst-case Redundancy of Optimal Binary AIFV Codes and Their Extended Codes
inferred← citeshttps://doi.org/10.1109/tit.2020.2987309openalex-snapshot
Some Tight Lower Bounds on the Redundancy of Optimal Binary Prefix-Free and Fix-Free Codes
inferred← citeshttps://doi.org/10.1145/290159.290162openalex-snapshot
Arithmetic coding revisited
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0602067openalex-snapshot
Renyi to Renyi -- Source Coding under Siege
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0702059openalex-snapshot
Redundancy-Related Bounds on Generalized Huffman Codes
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.