EDBT 2026 Demo / reviewers in the wild / expert
Lin Huynh
dblp:248/3430
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1997
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Coding theory · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › source coding › entropy coding
arithmetic coding |
0.0 | 1 | 1997 | A probability-ratio approach to approximate binary arithmetic coding · IEEE Trans. Inf. Theory 1997 |
Coding theory › error-correcting codes › arithmetic codes
binary arithmetic coding |
0.0 | 1 | 1997 | A probability-ratio approach to approximate binary arithmetic coding · IEEE Trans. Inf. Theory 1997 |
Coding theory
source coding |
0.0 | 1 | 1997 | A probability-ratio approach to approximate binary arithmetic coding · IEEE Trans. Inf. Theory 1997 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1997 | A probability-ratio approach to approximate binary arithmetic codingabstractWe describe an alternative mechanism for approximate binary arithmetic coding. The quantity that is approximated is the ratio between the probabilities of the two symbols. Analysis is given to show that the inefficiency so introduced is less than 0.7% on average; and in practice the compression loss is negligible. Lin Huynh, Alistair Moffat |
IEEE Trans. Inf. Theory | 1 |