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

Yu Wang 0151

dblp:02/5889-151 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2010
0000-0003-3004-2415ORCID · conflict

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

Theory of computation · 1Applied, interdisciplinary, general and emerging computing · 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%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
cyclic codes		 0.112010
Some results on cyclic codes over F2 + UpsilonF2 · IEEE Trans. Inf. Theory 2010
Coding theory › error-correcting codes › block codes › linear code
generator polynomials		 0.112010
Some results on cyclic codes over F2 + UpsilonF2 · IEEE Trans. Inf. Theory 2010
Coding theory › error-correcting codes › block codes › linear code
idempotent generator		 0.112010
Some results on cyclic codes over F2 + UpsilonF2 · IEEE Trans. Inf. Theory 2010

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

finite ring · 0.1binary cyclic code · 0.1
YearPublicationVenuePosition
2010 Some results on cyclic codes over F2 + UpsilonF2
abstract
In this paper, we investigate the structure and properties of cyclic codes over the ringF2+vF2. We first study the relationship between cyclic codes overF2+vF2and binary cyclic codes. Then we prove that cyclic codes over the ring are principally generated, and give the generator polynomial of cyclic codes over the ring. Finally, we obtain the unique idempotent generators for cyclic codes of odd length and determine the number of cyclic codes for a given lengthnoverF2+vF2.
Shixin Zhu, Yu Wang 0151, Minjia Shi
 IEEE Trans. Inf. Theory2
2009 Cyclic codes over F2 + vF2
abstract
In this paper, we investigate the structure and properties of cyclic codes over the ring F2+ vF2. We first study the relationship between cyclic codes over F2+ vF2and binary cyclic codes. Then we prove that cyclic codes over the ring are principally generated, and give the generator polynomial of cyclic codes over the ring. Finally, we obtain the unique idempotent generators for cyclic codes of odd length over F2+ vF2.
Shixin Zhu, Yu Wang 0151, Minjia Shi
 ISIT2