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

Chaoping Dong

dblp:02/8282 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2008
—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 · 100%
Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
algebraic coding theory		 0.112008
A Note on Permutation Polynomials Over BBZ n · IEEE Trans. Inf. Theory 2008
Coding theory › finite fields
permutation polynomials		 0.112008
A Note on Permutation Polynomials Over BBZ n · IEEE Trans. Inf. Theory 2008
Cryptographic primitives and cryptanalysis › finite field
permutation polynomials		 0.012008
A Note on Permutation Polynomials Over BBZ n · IEEE Trans. Inf. Theory 2008
YearPublicationVenuePosition
2008 A Note on Permutation Polynomials Over BBZ n
abstract
Permutation polynomials have applications in coding theory, cryptography, combinatorial designs, and they have been studied for over a hundred years. Recently, permutation polynomials over Znhave been used to construct interleavers for turbo codes. In this paper, we determine all permutation polynomials over Znwith degree no more than six.
Guobiao Weng, Chaoping Dong
 IEEE Trans. Inf. Theory2