On the public citation graph
Local redundancy and progressive bounds on the redundancy of a Huffman code
0 signed · 31 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/s0019-9958(77)80011-9openalex-snapshot
An improved bound for weight-balanced tree
inferredcites →https://doi.org/10.1109/18.108260openalex-snapshot
Tight bounds on the redundancy of Huffman 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.)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4419-8608-5openalex-snapshot
A First Course in Information Theory
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/s0304-3975(96)00320-9openalex-snapshot
Optimal binary search trees
inferred← citeshttps://doi.org/10.1023/a:1008273408148openalex-snapshot
On Lower Bounds for the Redundancy of Optimal 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.904513openalex-snapshot
Some basic properties of fix-free codes
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.1993.253145openalex-snapshot
Codes with monotonic codeword lengths
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/isit.2008.4595329openalex-snapshot
Redundancy and optimality of codes for infinite-entropy sources
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9517894openalex-snapshot
On Multi-Channel Huffman Codes for Asymmetric-Alphabet Channels
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9518152openalex-snapshot
Constructing Multiclass Classifiers using Binary Classifiers Under Log-Loss
inferred← citeshttps://doi.org/10.1109/itw.2006.1633796openalex-snapshot
Tight Bounds on the Redundancy of Huffman Codes
inferred← citeshttps://doi.org/10.1109/itwksps.2010.5503211openalex-snapshot
Zero-error multichannel source coding
inferred← citeshttps://doi.org/10.1109/sequen.1997.666911openalex-snapshot
Code and parse trees for lossless source encoding
inferred← citeshttps://doi.org/10.1109/tcomm.2024.3355315openalex-snapshot
Improved Upper Bounds on the Average Redundancy of Optimal RVLC
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.2012.2208580openalex-snapshot
Tight Bounds on the Redundancy of Huffman Codes\hbox{ H }\hbox{ H }
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
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.