Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from VLDB 2026 / reviewers in the wild / expert

Zhe-Xian Wan

dblp:45/8211 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2010
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 1 · 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 · 56% Mathematical optimization · 44%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Mathematical optimization › approximation theory
rational approximation		 0.112010
Strict optimal rational approximants of multisequences · IEEE Trans. Inf. Theory 2010
Coding theory › sequences › sequence design
sequence synthesis		 0.112010
Strict optimal rational approximants of multisequences · IEEE Trans. Inf. Theory 2010
Coding theory › sequences
multisequence		 0.012010
Strict optimal rational approximants of multisequences · IEEE Trans. Inf. Theory 2010

Methods — techniques the papers use, named apart from their topics

strict optimal rational approximant · 0.1algorithm · 0.1
YearPublicationVenuePosition
2010 Strict optimal rational approximants of multisequences
abstract
The synthesis problem of multisequences of elements of a fieldFis studied. A new way of approximation by rational functions to multisequences is introduced. Different from the usual approach by optimal rational approximant profile, in the proposed strict optimal rational approximant of a multisequence, the components of the optimal rational approximant are not required to have the same denominator. An algorithm to obtain a strict optimal rational approximant profile is established. The relation between optimal rational approximant and strict optimal rational approximant is studied.
Zhe-Xian Wan
 IEEE Trans. Inf. Theory1
1997 State Spaces of Convolutional Codes
Zhe-Xian Wan
 Des. Codes Cryptogr.1