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.
EDBT 2026 Demo / reviewers in the wild / expert

Guang-Zeng Feng

dblp:23/3193 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2000
—ORCID · none

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

Theory of computation · 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
1 paper
Coding theory · 78% Mathematical optimization · 22%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › cyclic codes
BCH codes		 0.012000
Minimum cyclotomic coset representatives and their applications to BCH codes and Goppa Codes · IEEE Trans. Inf. Theory 2000
Coding theory › finite fields
cyclotomic cosets		 0.012000
Minimum cyclotomic coset representatives and their applications to BCH codes and Goppa Codes · IEEE Trans. Inf. Theory 2000
Mathematical optimization › high-dimensional statistics
dimension estimation		 0.012000
Minimum cyclotomic coset representatives and their applications to BCH codes and Goppa Codes · IEEE Trans. Inf. Theory 2000
Coding theory
error-correcting codes		 0.012000
Minimum cyclotomic coset representatives and their applications to BCH codes and Goppa Codes · IEEE Trans. Inf. Theory 2000
Coding theory › error-correcting codes › algebraic geometry code
goppa codes		 0.012000
Minimum cyclotomic coset representatives and their applications to BCH codes and Goppa Codes · IEEE Trans. Inf. Theory 2000
Coding theory
minimum distance estimation		 0.012000
Minimum cyclotomic coset representatives and their applications to BCH codes and Goppa Codes · IEEE Trans. Inf. Theory 2000
YearPublicationVenuePosition
2000 Minimum cyclotomic coset representatives and their applications to BCH codes and Goppa Codes
abstract
We consider the minimum cyclotomic coset representatives and derive some of their properties. The results allow more precise estimates of the dimension of Bose-Chaudhuri-Hocquenghem (BCH) and classical Goppa codes of a given designed minimum distance, and more precise estimates of the true designed distance of BCH codes and the minimum distance of classical Goppa codes.
Dian-Wu Yue, Guang-Zeng Feng
 IEEE Trans. Inf. Theory2