Demo Data from EDBT 2026 / reviewers in the wild / expert
A. Y. C. Quan
dblp:173/1832
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1974
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 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.
| Computer networks
1 paper |
Physical-layer communications · 100% | |
| Theoretical computer science
1 paper |
Coding theory · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Integrated circuit design · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Physical-layer communications › signal design
sequence construction |
0.0 | 1 | 1974 | A Note On High-Speed Generation of Maximal Length Sequences · IEEE Trans. Computers 1974 |
Physical-layer communications
spread spectrum |
0.0 | 1 | 1974 | A Note On High-Speed Generation of Maximal Length Sequences · IEEE Trans. Computers 1974 |
Coding theory › sequences › pseudorandom sequences
m-sequences |
0.0 | 1 | 1974 | A Note On High-Speed Generation of Maximal Length Sequences · IEEE Trans. Computers 1974 |
Coding theory › sequences
sequence generation |
0.0 | 1 | 1974 | A Note On High-Speed Generation of Maximal Length Sequences · IEEE Trans. Computers 1974 |
Integrated circuit design › digital circuit design
high-speed digital circuits |
0.0 | 1 | 1974 | A Note On High-Speed Generation of Maximal Length Sequences · IEEE Trans. Computers 1974 |
Methods — techniques the papers use, named apart from their topics
decimation · 0.0time-division multiplexing · 0.0time division multiplexing · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1974 | A Note On High-Speed Generation of Maximal Length SequencesabstractIt is shown that high-speed generation of maximal length sequences can be realized by time division multiplexing instead of modulo-two adding the sequences obtained by decimation of a maximal length sequence. The advantage of this method is that higher speeds are obtainable. A. Y. C. Quan |
IEEE Trans. Computers | 1 |