Demo Data from EDBT 2026 / reviewers in the wild / expert
Siman Yang
dblp:57/1115
· DBLP profile ↗
4ranked-venue papers
2as first author
0since 2021 · last 2017
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 3 · 1 first-authorTheory 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 › error-correcting codes
algebraic geometry code |
0.1 | 1 | 2009 | Improvements on Parameters of Algebraic-Geometry Codes From Hermitian Curves · IEEE Trans. Inf. Theory 2009 |
Coding theory › error-correcting codes › algebraic geometry code
hermitian codes |
0.1 | 1 | 2009 | Improvements on Parameters of Algebraic-Geometry Codes From Hermitian Curves · IEEE Trans. Inf. Theory 2009 |
Coding theory › error-correcting codes › coding bounds › minimum distance bounds
singleton bound |
0.0 | 1 | 2009 | Improvements on Parameters of Algebraic-Geometry Codes From Hermitian Curves · IEEE Trans. Inf. Theory 2009 |
Methods — techniques the papers use, named apart from their topics
vlăduț–xing method · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2017 | Explicit factorizations of cyclotomic polynomials over finite fields
Hongfeng Wu, Rongquan Feng, Siman Yang |
Des. Codes Cryptogr. | 4 |
| 2009 | On improved asymptotic bounds for codes from global function fields
Siman Yang, Lulu Qi |
Des. Codes Cryptogr. | 1 |
| 2009 | Improvements on Parameters of Algebraic-Geometry Codes From Hermitian CurvesabstractUsing the VlĂduŢ–Xing method, we refine a construction of Xu to improve the parameters of algebraic-geometry codes based on Hermitian curves. The parameters of these Hermitian codes are arbitrarily close to the Singleton bound, provided that the length of the code is sufficiently large. We also exhibit a class of Hermitian codes over any finite field${\BBF}_{q^2}$$(q > 2)$with good parameters. Siman Yang |
IEEE Trans. Inf. Theory | 1 |
| 2007 | A Practical Optimal Padding for Signature Schemes
Haifeng Qian, Zhibin Li 0005, Siman Yang |
CT-RSA | 4 |