Demo Data from VLDB 2026 / reviewers in the wild / expert
Yuta Tsujii
dblp:42/11142
· DBLP profile ↗
3ranked-venue papers
1as first author
0since 2021 · last 2014
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 1Security and privacy · 1Theory of computation · 1Applied, interdisciplinary, general and emerging computing · 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% | |
| Computer networks
1 paper |
Physical-layer communications · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › sequences › sequence design
spreading sequences |
0.2 | 1 | 2014 | Finite Field Spreading for Multiple-Access Channel · IEEE Trans. Commun. 2014 |
Physical-layer communications › multiple access
multiple access channel |
0.1 | 1 | 2014 | Finite Field Spreading for Multiple-Access Channel · IEEE Trans. Commun. 2014 |
Physical-layer communications › signal detection
multiuser detection |
0.1 | 1 | 2014 | Finite Field Spreading for Multiple-Access Channel · IEEE Trans. Commun. 2014 |
Methods — techniques the papers use, named apart from their topics
factor graph · 0.4extrinsic information transfer analysis · 0.4LDPC coding · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2014 | Finite Field Spreading for Multiple-Access ChannelabstractAs a generalization of the binary spreading scheme in conventional direct-sequence code-division multiple-access (DS-CDMA) and interleave-division multiple-access (IDMA), a finite field spreading scheme is proposed for a synchronous multiple-access channel (MAC) with Gaussian noise and equal-power users. For each user, each information symbol over a finite field is spread into a length-L field vector by L-field multiplications. At the receiver, an iterative multi-user decoding algorithm on a factor graph is developed to recover each user's information symbol. To estimate the bit error rate performance of an uncoded finite field spreading system, an extrinsic information transfer analysis of the finite field despreading is given. This analysis shows that in addition to overcoming multi-user interference, the finite field spreading scheme can also provide an additional coding gain to overcome Gaussian noise compared with the conventional spreading scheme. This coding gain increases with the field order. The finite field spreading serially concatenated with a nonbinary low-density parity-check (LDPC) code, with field order 64, approaches the MAC capacity within 0.26 dB at a sum rate of 0.25. Guanghui Song, Yuta Tsujii, Jun Cheng 0001, Yoichiro Watanabe |
IEEE Trans. Commun. | 2 |
| 2013 | Approaching multiple-access channel capacity by nonbinary coding-spreadingabstractAs a generalization of the binary coding-spreading scheme, nonbinary coding-spreading scheme is proposed for a synchronous binary-input multiple-access channel (MAC) with Gaussian noise, equal-power, and equal-rate users. In this scheme, each user employs the same nonbinary low-density parity-check code serially concatenated with a nonbinary low-rate mapping, referred to as nonbinary spreading. A user-specific interleaving is employed to make the transmitted data of each user random-like. It is shown that the iterative multi-user decoding threshold of nonbinary coding-spreading scheme is less than 0.5 dB away from the MAC capacity at many sum rates. Yuta Tsujii, Guanghui Song, Jun Cheng 0001, Yoichiro Watanabe |
ISIT | 1 |
| 2012 | Extrinsic information transfer analysis of finite field spreading
Guanghui Song, Yuta Tsujii, Jun Cheng 0001, Yoichiro Watanabe |
ISITA | 2 |