VLDB 2026 Research / reviewers in the wild / expert
Weijuan Shan
dblp:57/735
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1998
—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 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › sequences › pseudorandom sequences
legendre sequences |
0.0 | 1 | 1998 | On the Linear Complexity of Legendre Sequences · IEEE Trans. Inf. Theory 1998 |
Coding theory › sequences
linear complexity |
0.0 | 1 | 1998 | On the Linear Complexity of Legendre Sequences · IEEE Trans. Inf. Theory 1998 |
Coding theory
sequences |
0.0 | 1 | 1998 | On the Linear Complexity of Legendre Sequences · IEEE Trans. Inf. Theory 1998 |
Coding theory
linear feedback shift register |
0.0 | 1 | 1998 | On the Linear Complexity of Legendre Sequences · IEEE Trans. Inf. Theory 1998 |
Methods — techniques the papers use, named apart from their topics
feedback polynomial analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1998 | On the Linear Complexity of Legendre SequencesabstractWe determine the linear complexity of all Legendre sequences and the (monic) feedback polynomial of the shortest linear feedback shift register that generates such a Legendre sequence. The result shows that Legendre sequences are quite good from the linear complexity viewpoint. Cunsheng Ding, Tor Helleseth, Weijuan Shan |
IEEE Trans. Inf. Theory | 3 |