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

Lin Xiaoyan

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

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

Theory of computation · 1 · 1 first-author

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
Quantum computing and quantum information · 50% Coding theory · 50%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › block codes › linear code
constacyclic codes
0.012004
Quantum cyclic and constacyclic codes · IEEE Trans. Inf. Theory 2004
Quantum computing and quantum information › quantum error correction
quantum code
0.012004
Quantum cyclic and constacyclic codes · IEEE Trans. Inf. Theory 2004
Quantum computing and quantum information
quantum error correction
0.012004
Quantum cyclic and constacyclic codes · IEEE Trans. Inf. Theory 2004
Coding theory › error-correcting codes › codes over rings
quaternary codes
0.012004
Quantum cyclic and constacyclic codes · IEEE Trans. Inf. Theory 2004

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

classical quaternary constacyclic codes · 0.0
YearPublicationVenuePosition
2004 Quantum cyclic and constacyclic codes
abstract
Based on classical quaternary constacyclic linear codes, we construct a set of quantum codes with parameters [[(4/sup m/ -1)/3, (4/sup m/ -1)/3 -2(3l + b)m, 4l + b + 2]] where m/spl ges/4, 1/spl les/b/spl les/3, and 12l + 3b < 2 /spl times/ 4/sup /spl lfloor/(m+2)/3/spl rfloor//-1, which are better than the codes in Bierbrauer and Edel (2000).
Lin Xiaoyan
IEEE Trans. Inf. Theory1