Demo Data from VLDB 2026 / reviewers in the wild / expert
Tina Lindkvist
dblp:68/3753
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2002
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory 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 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › frameproof codes
identifiable parent property codes |
0.0 | 1 | 2002 | A class of traceability codes · IEEE Trans. Inf. Theory 2002 |
Coding theory › frameproof codes
traceability codes |
0.0 | 1 | 2002 | A class of traceability codes · IEEE Trans. Inf. Theory 2002 |
Coding theory
traitor tracing |
0.0 | 1 | 2002 | A class of traceability codes · IEEE Trans. Inf. Theory 2002 |
Methods — techniques the papers use, named apart from their topics
hamming distance decoding · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2002 | A class of traceability codesabstractTraceability codes are identifiable parent property (IPP) codes with the additional requirement that the Hamming distance can be used to trace a parent of a word. Traceability codes can be used for constructing digital fingerprints in order to deter users from illegally copying digital data. We construct a class of traceability codes and determine the exact parameters of some of the codes in this class. Tina Lindkvist, Jacob Löfvenberg, Mattias Svanström |
IEEE Trans. Inf. Theory | 1 |