Demo Data from EDBT 2026 / reviewers in the wild / expert
Mark Ballan
dblp:62/2166
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1990
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 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 · 75% Computational geometry · 25% |
Topics — the 4 heaviest of 4, 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 | 1990 | Quasi-cyclic unit memory convolutional codes · IEEE Trans. Inf. Theory 1990 |
Computational geometry
distance measures |
0.0 | 1 | 1990 | Quasi-cyclic unit memory convolutional codes · IEEE Trans. Inf. Theory 1990 |
Coding theory › error-correcting codes › block codes › linear code
quasi-cyclic codes |
0.0 | 1 | 1990 | Quasi-cyclic unit memory convolutional codes · IEEE Trans. Inf. Theory 1990 |
Coding theory › error-correcting codes › convolutional codes
unit memory codes |
0.0 | 1 | 1990 | Quasi-cyclic unit memory convolutional codes · IEEE Trans. Inf. Theory 1990 |
Methods — techniques the papers use, named apart from their topics
computer search · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1990 | Quasi-cyclic unit memory convolutional codesabstractUnit memory convolutional codes with generator matrices, which are composed of circulant submatrices, are introduced. This structure facilitates the analysis of efficient search for good codes. Equivalences among such codes and some of the basic structural properties are discussed. In particular, catastrophic encoders and minimal encoders are characterized and dual codes treated. Further, various distance measures are discussed, and a number of good codes, some of which result from efficient computer search and some of which result from known block codes, are presented.> Jørn Justesen, Erik Paaske, Mark Ballan |
IEEE Trans. Inf. Theory | 3 |