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

Yue-fei Zhu

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

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

Theory of computation · 1Applied, interdisciplinary, general and emerging computing · 1

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 · 80% Algorithms and data structures · 20%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › decoding › algebraic decoding
berlekamp-massey algorithm		 0.012004
On the Lattice Basis Reduction Multisequence Synthesis Algorithm · IEEE Trans. Inf. Theory 2004
Coding theory › sequences › linear complexity
shift-register synthesis		 0.012004
On the Lattice Basis Reduction Multisequence Synthesis Algorithm · IEEE Trans. Inf. Theory 2004
Algorithms and data structures › number-theoretic algorithms
lattice basis reduction		 0.012001
F[x]-lattice basis reduction algorithm and multisequence synthesis · Sci. China Ser. F Inf. Sci. 2001

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

lattice basis reduction · 0.0f[x]-lattice basis reduction · 0.0
YearPublicationVenuePosition
2004 On the Lattice Basis Reduction Multisequence Synthesis Algorithm
abstract
A lattice basis reduction multisequence synthesis (LBRMS) algorithm was presented with a new, intuitive and vector-form model. In this paper, a refined version of the LBRMS algorithm is deduced, from which Massey's conjectured algorithm can be derived. Moreover, if we modify the lattice basis reduction algorithm used in the LBRMS algorithm, a new synthesis algorithm is deduced, which is equivalent to the generalization of the Berlekamp-Massey algorithm proposed by Feng and Tzeng (1989). Therefore, the LBRMS algorithm provides a unified approach to the multisequence shift-register synthesis problem.
Liping Wang 0005, Yue-fei Zhu, Ding-Yi Pei
 IEEE Trans. Inf. Theory2
2001 F[x]-lattice basis reduction algorithm and multisequence synthesis
Liping Wang 0005, Yue-fei Zhu
 Sci. China Ser. F Inf. Sci.2