Demo Data from EDBT 2026 / reviewers in the wild / expert
M. A. Deaett
dblp:134/5211
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1978
—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 |
Information theory · 87% Coding theory · 13% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information theory › network information theory › multiple-access channel
adder channel |
0.0 | 1 | 1978 | Some very simple codes for the nonsynchronized two-user multiple-access adder channel with binary inputs (Corresp.) · IEEE Trans. Inf. Theory 1978 |
Information theory › network information theory
multiple-access channel |
0.0 | 1 | 1978 | Some very simple codes for the nonsynchronized two-user multiple-access adder channel with binary inputs (Corresp.) · IEEE Trans. Inf. Theory 1978 |
Coding theory › error-correcting codes › q-ary codes
binary codes |
0.0 | 1 | 1978 | Some very simple codes for the nonsynchronized two-user multiple-access adder channel with binary inputs (Corresp.) · IEEE Trans. Inf. Theory 1978 |
Methods — techniques the papers use, named apart from their topics
code construction · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1978 | Some very simple codes for the nonsynchronized two-user multiple-access adder channel with binary inputs (Corresp.)abstractSome very simple codes are given for the two-user multiple-access adder channel with binary inputs that do not require word or bit synchronism between the encoders nor between the decoder and the encoders. M. A. Deaett, Jack K. Wolf |
IEEE Trans. Inf. Theory | 1 |