On the public citation graph

New 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.1016/s0019-9958(77)80011-9openalex-snapshot
An improved bound for weight-balanced tree
inferredcites →https://doi.org/10.1109/18.42226openalex-snapshot
Tight upper bounds on the redundancy of Huffman codes
inferredcites →https://doi.org/10.1109/18.59940openalex-snapshot
Optimum '1'-ended binary prefix codes
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.1201/9781439825716-6openalex-snapshot
Introduction to information theory

What points at this work

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

inferred← citeshttps://doi.org/10.1002/0471219282.eot397openalex-snapshot
H uffman Coding
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.1007/bf02243872openalex-snapshot
Is Huffman coding dead?
inferred← citeshttps://doi.org/10.1007/s00453-007-9140-4openalex-snapshot
A Fast Algorithm for Adaptive Prefix Coding
inferred← citeshttps://doi.org/10.1016/b978-012443895-8/50009-xopenalex-snapshot
Data Compression
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.1049/iet-com.2010.0049openalex-snapshot
Anti-uniform Huffman codes
inferred← citeshttps://doi.org/10.1093/bioinformatics/btv561openalex-snapshot
smallWig: parallel compression of RNA-seq WIG files
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.259639openalex-snapshot
Block arithmetic coding for source compression
inferred← citeshttps://doi.org/10.1109/18.335933openalex-snapshot
Binary prefix codes ending in a "1"
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.771230openalex-snapshot
On the composition of Tunstall messages
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/access.2019.2932206openalex-snapshot
Lower Bounds on the Redundancy of Huffman Codes With Known and Unknown Probabilities
inferred← citeshttps://doi.org/10.1109/ciss.2008.4558666openalex-snapshot
Tight bounds on the AUH codes
inferred← citeshttps://doi.org/10.1109/dcc.1992.227470openalex-snapshot
On binary alphabetical codes
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.1997.582059openalex-snapshot
Efficient approximate adaptive coding
inferred← citeshttps://doi.org/10.1109/iccms.2010.177openalex-snapshot
A Huffman Codes Based Approach to Achieve Minimum Redundancy
inferred← citeshttps://doi.org/10.1109/idea49133.2020.9170679openalex-snapshot
A Review on Medical Image Data Compression Techniques
inferred← citeshttps://doi.org/10.1109/isit.2006.261853openalex-snapshot
A Fast Algorithm for Adaptive Prefix Coding
inferred← citeshttps://doi.org/10.1109/isscs.2007.4292770openalex-snapshot
Bounds on Codeword Lengths of Optimal Codes for Noiseless Channels
inferred← citeshttps://doi.org/10.1109/itw.2006.1633796openalex-snapshot
Tight Bounds on the Redundancy of Huffman Codes
inferred← citeshttps://doi.org/10.1109/iwcit.2014.6842508openalex-snapshot
A note on the redundancy of reversible variable length 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/tcomm.2023.3265413openalex-snapshot
Some Results for the Redundancy Bound of the Optimal Ternary AIFV Codes
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.2011.2145590openalex-snapshot
Minimum Expected Length of Fixed-to-Variable Lossless Compression Without Prefix Constraints
inferred← citeshttps://doi.org/10.1109/tit.2012.2189433openalex-snapshot
Some Upper Bounds on the Redundancy of Optimal Binary Fix-Free 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.2013.2294832openalex-snapshot
Huffman Redundancy for Large Alphabet Sources
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
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.