Demo Data from EDBT 2026 / reviewers in the wild / expert
Kwok-Kwong Stephen Choi
dblp:50/2488
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2004
—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 · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › sequences
binary sequences |
0.0 | 1 | 2004 | Binary sequences with merit factor greater than 6.34 · IEEE Trans. Inf. Theory 2004 |
Coding theory › sequences › binary sequences
merit factor |
0.0 | 1 | 2004 | Binary sequences with merit factor greater than 6.34 · IEEE Trans. Inf. Theory 2004 |
Methods — techniques the papers use, named apart from their topics
numerical experimentation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2004 | Binary sequences with merit factor greater than 6.34abstractThe maximum known asymptotic merit factor for binary sequences has been stuck at a value of 6 since the 1980s. Several authors have suggested that this value cannot be improved. In this paper, we construct an infinite family of binary sequences whose asymptotic merit factor we conjecture to be greater than 6.34. We present what we believe to be compelling evidence in support of this conjecture. The numerical experimentation that led to this construction is a significant part of the story. Peter B. Borwein, Kwok-Kwong Stephen Choi, Jonathan Jedwab |
IEEE Trans. Inf. Theory | 2 |