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

Zekai Chen 0003

dblp:275/8971-3 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2026
0009-0008-3398-1702ORCID · verified

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

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › block codes › linear code
constacyclic codes
1.012026
Constacyclic Codes With Best-Known Parameters · IEEE Trans. Inf. Theory 2026
Coding theory › error-correcting codes › block codes
linear code
1.012026
Constacyclic Codes With Best-Known Parameters · IEEE Trans. Inf. Theory 2026
Coding theory › error-correcting codes › coding bounds
minimum distance bounds
1.012026
Constacyclic Codes With Best-Known Parameters · IEEE Trans. Inf. Theory 2026

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

finite field construction · 1.0
YearPublicationVenuePosition
2026 Constacyclic Codes With Best-Known Parameters
abstract
In this paper, we construct several infinite families ofq-ary constacyclic codes over a finite field Fqwith lengthn, dimension aroundn/2, and minimum distance at leastcn/ logqnfor some positive constantc. They contain many constacyclic codes with optimal, or almost-optimal, or best-known parameters. We also consider constacyclic codes of various lengths.
Zekai Chen 0003, Min Sha
IEEE Trans. Inf. Theory1