Demo Data from VLDB 2026 / reviewers in the wild / expert
J. C. C. M. Remijn
dblp:83/6549
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 1988
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 2 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 · 100% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes › coding bounds
carlitz-uchiyama bound |
0.0 | 1 | 1988 | A duality theorem for the weight distribution of some cyclic codes · IEEE Trans. Inf. Theory 1988 |
Coding theory › error-correcting codes
cyclic codes |
0.0 | 1 | 1988 | A duality theorem for the weight distribution of some cyclic codes · IEEE Trans. Inf. Theory 1988 |
Coding theory › exponential sums
kloosterman sums |
0.0 | 1 | 1988 | A duality theorem for the weight distribution of some cyclic codes · IEEE Trans. Inf. Theory 1988 |
Coding theory › error-correcting codes › coding bounds
minimum distance bounds |
0.0 | 1 | 1988 | A duality theorem for the weight distribution of some cyclic codes · IEEE Trans. Inf. Theory 1988 |
Coding theory › error-correcting codes
weight distribution |
0.0 | 1 | 1988 | A duality theorem for the weight distribution of some cyclic codes · IEEE Trans. Inf. Theory 1988 |
Coding theory › error-correcting codes
algebraic coding theory |
0.0 | 1 | 1984 | The minimum distance of the [38, 19] ternary extended QR-code is 11 · IEEE Trans. Inf. Theory 1984 |
Coding theory › error-correcting codes
quadratic residue code |
0.0 | 1 | 1984 | The minimum distance of the [38, 19] ternary extended QR-code is 11 · IEEE Trans. Inf. Theory 1984 |
Coding theory › error-correcting codes › block codes › linear code › constacyclic codes
negacyclic code |
0.0 | 1 | 1988 | A duality theorem for the weight distribution of some cyclic codes · IEEE Trans. Inf. Theory 1988 |
Methods — techniques the papers use, named apart from their topics
weil-carlitz-uchiyama estimate · 0.0kloosterman sums · 0.0weight enumerator computation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1988 | A duality theorem for the weight distribution of some cyclic codesabstractA close relationship between the weight enumerators of two cyclic codes is presented. The weights of the codewords are expressed in terms of Kloosterman sums. The Weil-Carlitz-Uchiyama estimate for Kloosterman sums is used to obtain bounds for the minimum distance of the codes. A relation with negacyclic codes is discussed.> J. C. C. M. Remijn, H. J. Tiersma |
IEEE Trans. Inf. Theory | 1 |
| 1984 | The minimum distance of the [38, 19] ternary extended QR-code is 11abstractThe method of Mykkeltveit, Lam, and McEliece for finding weight enumerators of binary QR-codes is used to prove that the minimum distance of the[38,19]ternary extended QR-code is11. J. C. C. M. Remijn, Cornelis de Vroedt |
IEEE Trans. Inf. Theory | 1 |