On the public citation graph

On the redundancy of optimal codes with limited word length

0 signed · 28 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.1049/ep.1969.0319openalex-snapshot
Information Theory and Reliable Communication
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.87001openalex-snapshot
New bounds on the redundancy of Huffman codes
inferredcites →https://doi.org/10.1109/18.9794openalex-snapshot
Correction to 'A heuristic algorithm for the construction of a code with limited word length'
inferredcites →https://doi.org/10.1109/26.1462openalex-snapshot
Comment on "Algorithm for construction of variable length code with limited maximum word length" by H. Murakami et al
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/tcom.1984.1095966openalex-snapshot
Algorithm for Construction of Variable Length Code with Limited Maximum Word Length
inferredcites →https://doi.org/10.1109/tcom.1986.1096476openalex-snapshot
Comment on "Algorithm for Construction of Variable Length Code with Limited Maximum Word Length"
inferredcites →https://doi.org/10.1109/tit.1971.1054638openalex-snapshot
Codes based on inaccurate source probabilities
inferredcites →https://doi.org/10.1109/tit.1974.1055176openalex-snapshot
Constructing codes with bounded codeword lengths (Corresp.)
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.1057302openalex-snapshot
A heuristic algorithm for the construction of a code with limited word length (Corresp.)
inferredcites →https://doi.org/10.1137/0122024openalex-snapshot
Path Length of Binary Search Trees
inferredcites →https://doi.org/10.1137/0203008openalex-snapshot
Optimal Binary Search Trees with Restricted Maximal Depth
inferredcites →https://doi.org/10.1145/79147.79150openalex-snapshot
A fast algorithm for optimal length-limited Huffman codes

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-4615-3596-6_8openalex-snapshot
Variations on a Theme by Gallager
inferred← citeshttps://doi.org/10.1007/s00453-001-0060-4openalex-snapshot
Bounding the Inefficiency of Length-Restricted Prefix Codes
inferred← citeshttps://doi.org/10.1109/18.312175openalex-snapshot
Parallelized Huffman and Hu-Tucker searching
inferred← citeshttps://doi.org/10.1109/18.959291openalex-snapshot
On the cost of worst case coding length constraints
inferred← citeshttps://doi.org/10.1109/49.848247openalex-snapshot
Robust image transmission using resynchronizing variable-length codes and error concealment
inferred← citeshttps://doi.org/10.1109/isit.2008.4595434openalex-snapshot
Prefix codes for power laws
inferred← citeshttps://doi.org/10.1109/isit.2012.6284698openalex-snapshot
Relations between redundancy patterns of the Shannon code and wave diffraction patterns of partially disordered media
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.2006.881728openalex-snapshot
Source Coding for Quasiarithmetic Penalties
inferred← citeshttps://doi.org/10.1109/tit.2011.2173633openalex-snapshot
Variable Length Unordered Codes
inferred← citeshttps://doi.org/10.1109/tit.2012.2185035openalex-snapshot
Relations Between Redundancy Patterns of the Shannon Code and Wave Diffraction Patterns of Partially Disordered Media
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.