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

Chun'e Zhao

dblp:259/0980 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
1since 2021 · last 2025
0000-0002-8217-3356ORCID · reported

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

Security and privacy · 1Theory of computation · 1 · 1 first-author · 1 since 2021

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 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory
error-correcting codes
0.912025
Research on the Construction of Maximum Distance Separable Codes via Arbitrary Twisted Generalized Reed-Solomon Codes · IEEE Trans. Inf. Theory 2025
Coding theory › error-correcting codes › algebraic geometry code
generalized reed-solomon codes
0.912025
Research on the Construction of Maximum Distance Separable Codes via Arbitrary Twisted Generalized Reed-Solomon Codes · IEEE Trans. Inf. Theory 2025
Coding theory › error-correcting codes › block codes
MDS codes
0.912025
Research on the Construction of Maximum Distance Separable Codes via Arbitrary Twisted Generalized Reed-Solomon Codes · IEEE Trans. Inf. Theory 2025
Coding theory › error-correcting codes
reed-solomon codes
0.912025
Research on the Construction of Maximum Distance Separable Codes via Arbitrary Twisted Generalized Reed-Solomon Codes · IEEE Trans. Inf. Theory 2025
Coding theory › error-correcting codes › algebraic coding theory
twisted generalized reed-solomon codes
0.912025
Research on the Construction of Maximum Distance Separable Codes via Arbitrary Twisted Generalized Reed-Solomon Codes · IEEE Trans. Inf. Theory 2025

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

vandermonde matrix inversion · 0.9linear feedback shift register · 0.9
YearPublicationVenuePosition
2025 Research on the Construction of Maximum Distance Separable Codes via Arbitrary Twisted Generalized Reed-Solomon Codes
abstract
Maximum distance separable (MDS) codes have significant combinatorial and cryptographic applications due to their certain optimality. Generalized Reed-Solomon (GRS) codes are the most prominent MDS codes. Twisted generalized Reed-Solomon (TGRS) codes may not necessarily be MDS. It is meaningful to study the conditions under which TGRS codes are MDS. In this paper, we study a general class of TGRS (ATGRS) codes which include all the known special ones. First, we obtain another expression of the inverse of the Vandermonde matrix. Based on this, we further derive an equivalent condition under which an A-TGRS code is MDS. According to this, the A-TGRS MDS codes include nearly all the known related results in the previous literatures. More importantly, we also give three constructions to obtain many other classes of MDS TGRS codes with new parameter matrices. In addition, we present a new method to compute the inverse of the lower triangular Toplitz matrix by a linear feedback shift register, which will be very useful in many research fields.
Chun'e Zhao, Wenping Ma 0002, Tongjiang Yan
IEEE Trans. Inf. Theory1
2014 New optimal constructions of conflict-avoiding codes of odd length and weight 3
Wenping Ma 0002, Chun'e Zhao, Dongsu Shen
Des. Codes Cryptogr.2