VLDB 2026 Research / reviewers in the wild / expert
Tingyao Xiong
dblp:23/6664
· DBLP profile ↗
3ranked-venue papers
3as first author
1since 2021 · last 2021
0000-0001-9102-6609ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021
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 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › sequences › binary sequences
merit factor |
0.2 | 2 | 2011 | Modifications of Modified Jacobi Sequences · IEEE Trans. Inf. Theory 2011 Construction of Even Length Binary Sequences With Asymptotic Merit Factor 6 · IEEE Trans. Inf. Theory 2008 |
Coding theory
sequences |
0.1 | 1 | 2011 | Modifications of Modified Jacobi Sequences · IEEE Trans. Inf. Theory 2011 |
Coding theory › sequences
binary sequences |
0.1 | 1 | 2008 | Construction of Even Length Binary Sequences With Asymptotic Merit Factor 6 · IEEE Trans. Inf. Theory 2008 |
Coding theory › sequences › sequence design
correlation properties |
0.1 | 1 | 2008 | Construction of Even Length Binary Sequences With Asymptotic Merit Factor 6 · IEEE Trans. Inf. Theory 2008 |
Coding theory › sequences
sequence design |
0.1 | 1 | 2008 | Construction of Even Length Binary Sequences With Asymptotic Merit Factor 6 · IEEE Trans. Inf. Theory 2008 |
Coding theory › sequences › pseudorandom sequences
legendre sequences |
0.0 | 1 | 2011 | Modifications of Modified Jacobi Sequences · IEEE Trans. Inf. Theory 2011 |
Methods — techniques the papers use, named apart from their topics
character sequences · 0.1legendre sequence · 0.1jacobi sequences · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | Sieves for Binary Sequences with large SRS and SHG Contrast RatiosabstractIn this paper, we will prove that for shaped binary sequences, the central SRS and SHG contrast ratios are closely related to the traditional Merit Factor values. And in light of known results in Merit Factor Problems, we have constructed binary sequences with large central contrast ratios, based on Legendre sequences, Parker sequences, and m-sequences, with both theoretical and numerical analysis results presented. Tingyao Xiong, Jonathan I. Hall |
ISIT | 1 |
| 2011 | Modifications of Modified Jacobi SequencesabstractThe known families of binary sequences having asymptotic merit factor 6.0 are modifications to the families of Legendre sequences and Jacobi sequences. In this paper, we show that at N = pq, there are many suitable modifications other than the Jacobi or modified Jacobi sequences. Furthermore, we will give three new modifications to the character sequences of length N = pq. Based on these new modifications, for any pair of large p and q, we can construct a binary sequence of length 2pq so that such families of sequences have asymptotic merit factor 6.0 without cyclic shifting of the base sequences. Tingyao Xiong, Jonathan I. Hall |
IEEE Trans. Inf. Theory | 1 |
| 2008 | Construction of Even Length Binary Sequences With Asymptotic Merit Factor 6abstractStarting with the family of Legendre sequences of length p, Parker constructed a new family of binary sequences of length 2p with good negacyclic correlation properties. Computer calculations indicated that the asymptotic merit factor of his family is 6. In this correspondence a simple version of Parker's construction is given and further applied to Jacobi and modified Jacobi sequences. It is then proven that each of the families constructed, including Parker's, has asymptotic merit factor 6. Tingyao Xiong, Jonathan I. Hall |
IEEE Trans. Inf. Theory | 1 |