EDBT 2026 Demo / reviewers in the wild / expert
Gregory S. Lauer
dblp:84/3931
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 1986
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 1 · 1 first-authorTheory 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 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes
convolutional codes |
0.0 | 1 | 1979 | Some optimal partial-unit-memory codes (Corresp.) · IEEE Trans. Inf. Theory 1979 |
Coding theory › error-correcting codes › convolutional codes
partial unit memory codes |
0.0 | 1 | 1979 | Some optimal partial-unit-memory codes (Corresp.) · IEEE Trans. Inf. Theory 1979 |
Methods — techniques the papers use, named apart from their topics
equidistant block code construction · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1986 | Hierarchical Routing Design for Suran
Gregory S. Lauer |
ICC | 1 |
| 1979 | Some optimal partial-unit-memory codes (Corresp.)abstractA new class of time-invariant binary convolutional codes is defined, called partial-unit-memory codes. These codes are optimal in the sense of having maximum free distance for given values ofR, k(the number of encoder inputs), and\mu(the number of encoder memory cells). New optimal codes are given for ratesR=l/4, 1/3, 1/2, \and 2/3with\mu \leq 4 \and k \leq \mu + \3, whenever such a code is better than previously known An infinite class of optimal partial-unit-memory codes is also constructed based on equidistant block codes. Gregory S. Lauer |
IEEE Trans. Inf. Theory | 1 |