EDBT 2026 Demo / reviewers in the wild / expert
R. Kent Gilbert
dblp:15/526
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 1985
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 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
2 papers |
Coding theory · 77% Information theory · 23% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › source coding › sequential coding
causal coding |
0.0 | 1 | 1985 | Causal encoding of Markov sources (Ph.D. Abstr.) · IEEE Trans. Inf. Theory 1985 |
Information theory
information measures |
0.0 | 1 | 1985 | Causal encoding of Markov sources (Ph.D. Abstr.) · IEEE Trans. Inf. Theory 1985 |
Coding theory › source coding › source modeling
markov sources |
0.0 | 1 | 1985 | Causal encoding of Markov sources (Ph.D. Abstr.) · IEEE Trans. Inf. Theory 1985 |
Coding theory › source coding › predictive coding
differential pulse-code modulation |
0.0 | 1 | 1982 | Causal source codes · IEEE Trans. Inf. Theory 1982 |
Coding theory
source coding |
0.0 | 1 | 1982 | Causal source codes · IEEE Trans. Inf. Theory 1982 |
Methods — techniques the papers use, named apart from their topics
causal coding · 0.0rate-distortion theory · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1985 | Causal encoding of Markov sources (Ph.D. Abstr.)
R. Kent Gilbert |
IEEE Trans. Inf. Theory | 1 |
| 1982 | Causal source codesabstractCausal source codes are defined. These include quantizers, delta modulators, differential pulse code modulators, and adaptive versions of these. Several types of causal codes are identified. For memoryless sources it is shown that the optimum performance attainable by causal codes can be achieved by memoryless codes or by time-sharing memoryless codes. This optimal performance can be evaluated straightforwardly. David L. Neuhoff, R. Kent Gilbert |
IEEE Trans. Inf. Theory | 2 |