Demo Data from EDBT 2026 / reviewers in the wild / expert
Kottappuram Mohammed Mohiuddin
dblp:125/1099
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1989
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 1
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 2 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 | 1989 | A multiplication-free multialphabet arithmetic code · IEEE Trans. Commun. 1989 |
Coding theory
source coding |
0.0 | 1 | 1989 | A multiplication-free multialphabet arithmetic code · IEEE Trans. Commun. 1989 |
Methods — techniques the papers use, named apart from their topics
multiplication-free recursion · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1989 | A multiplication-free multialphabet arithmetic codeabstractA recursion for arithmetic codes used for data compression is described which requires no multiplication or division, even in the case of nonbinary alphabets. For this reason, such a code admits a simple and fast hardware implementation. The inputs to the code are, in addition to the symbols to be encoded, either the symbol probabilities or, more simply, the corresponding occurrence counts. Hence, the code is applicable in conjunction with stationary and nonstationary models alike. The code efficiency is typically in the range of 97-99%.> Jorma Rissanen, Kottappuram Mohammed Mohiuddin |
IEEE Trans. Commun. | 2 |