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.

Chenya Zhao

dblp:380/9927 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2024
—ORCID · none

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
constant-weight codes
0.812024
The Existence of Optimal (v,4,1) Optical Orthogonal Codes Achieving the Johnson Bound · IEEE Trans. Inf. Theory 2024
Coding theory › error-correcting codes › coding bounds › minimum distance bounds
johnson bound
0.812024
The Existence of Optimal (v,4,1) Optical Orthogonal Codes Achieving the Johnson Bound · IEEE Trans. Inf. Theory 2024
Coding theory › sequences › sequence design
optical orthogonal codes
0.812024
The Existence of Optimal (v,4,1) Optical Orthogonal Codes Achieving the Johnson Bound · IEEE Trans. Inf. Theory 2024

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

direct construction · 0.8
YearPublicationVenuePosition
2024 The Existence of Optimal (v,4,1) Optical Orthogonal Codes Achieving the Johnson Bound
abstract
Optical orthogonal codes have applications in optical code-division multiple access communication systems. They can also be used to construct protocol sequences for multiuser collision channel without feedback, and constant weight codes for error detection and correction. Direct constructions with explicit codewords are presented to settle the existence of a J-optimal$(v,4,1)$-optical orthogonal code with$\lfloor (v-1)/12\rfloor $codewords for any positive integer$v\neq 25$. As a corollary, it is shown that an optimal$(v,6,4)$-cyclically permutable constant weight code with$\lfloor (v-1)/12\rfloor $codewords exists for any positive integer$v\neq 25$.
Chenya Zhao, Yanxun Chang, Tao Feng 0002
IEEE Trans. Inf. Theory1