On the public citation graph
Optimum '1'-ended binary prefix codes
0 signed · 29 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 points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11534273_33openalex-snapshot
The Structure of Optimal Prefix-Free Codes in Restricted Languages: The Uniform Probability Case
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-1-84628-959-0openalex-snapshot
Variable-length Codes for Data Compression
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_30openalex-snapshot
More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding
inferred← citeshttps://doi.org/10.1016/j.aeue.2012.08.002openalex-snapshot
Infinite anti-uniform sources
inferred← citeshttps://doi.org/10.1109/18.119696openalex-snapshot
On the construction of statistically synchronizable codes
inferred← citeshttps://doi.org/10.1109/18.335933openalex-snapshot
Binary prefix codes ending in a "1"
inferred← citeshttps://doi.org/10.1109/18.490560openalex-snapshot
Extended synchronizing codewords for binary prefix codes
inferred← citeshttps://doi.org/10.1109/18.850708openalex-snapshot
A dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free 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.904513openalex-snapshot
Some basic properties of fix-free codes
inferred← citeshttps://doi.org/10.1109/dcc.2001.917145openalex-snapshot
Optimal prefix-free codes that end in a specified pattern and similar problems: the uniform probability case
inferred← citeshttps://doi.org/10.1109/dcc.2005.42openalex-snapshot
Generalizing the Kraft-McMillan Inequality to Restricted Languages
inferred← citeshttps://doi.org/10.1109/dcc.2010.35openalex-snapshot
When Huffman Meets Hamming: A Class of Optimal Variable-Length Error Correcting Codes
inferred← citeshttps://doi.org/10.1109/isit.1993.748531openalex-snapshot
Extended Synchronizing Codewords for Binary Prefix Codes
inferred← citeshttps://doi.org/10.1109/isit.1998.708625openalex-snapshot
A dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free codes
inferred← citeshttps://doi.org/10.1109/isit.2000.866304openalex-snapshot
The number of optimal binary one-ended codes
inferred← citeshttps://doi.org/10.1109/isit.2007.4557266openalex-snapshot
Kraft Inequality and Zero-Error Source Coding with Decoder Side Information
inferred← citeshttps://doi.org/10.1109/itnw.1999.814366openalex-snapshot
Basic properties of fix-free 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.1986.1057239openalex-snapshot
Bounds on the redundancy of Huffman codes (Corresp.)
inferred← citeshttps://doi.org/10.1109/tit.2002.1013157openalex-snapshot
Optimal binary one-ended codes
inferred← citeshttps://doi.org/10.1109/tit.2007.909161openalex-snapshot
Kraft Inequality and Zero-Error Source Coding With Decoder Side Information
inferred← citeshttps://doi.org/10.1109/tit.2008.926326openalex-snapshot
More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding
inferred← citeshttps://doi.org/10.1145/509907.510020openalex-snapshot
Huffman coding with unequal letter costs
inferred← citeshttps://doi.org/10.12785/amis/070101openalex-snapshot
Entropy and Average Cost of AUH Codes
inferred← citeshttps://doi.org/10.48550/arxiv.1002.4907openalex-snapshot
Twenty Questions Games Always End With Yes
inferred← citeshttps://doi.org/10.5555/1496770.1496853openalex-snapshot
A generic top-down dynamic-programming approach to prefix-free coding
inferred← citeshttps://doi.org/10.7907/6f03-mp11openalex-snapshot
Interval modulation: a new paradigm for the design of high speed optical communication systems
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.