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

Bo-Jun Yuan

dblp:265/8676 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2026
—ORCID · none

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

Theory of computation · 2 · 1 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 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 · 81% Combinatorics and discrete mathematics · 19%

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

TopicWeightPapersLastEvidence papers
Coding theory › distributed storage › distributed storage codes
fractional repetition codes		 1.012026
On Zero Skip-Cost Generalized Fractional-Repetition Codes From Covering Designs · IEEE Trans. Inf. Theory 2026
Combinatorics and discrete mathematics › combinatorial design
covering designs		 0.312026
On Zero Skip-Cost Generalized Fractional-Repetition Codes From Covering Designs · IEEE Trans. Inf. Theory 2026
Coding theory
distributed storage		 0.312026
On Zero Skip-Cost Generalized Fractional-Repetition Codes From Covering Designs · IEEE Trans. Inf. Theory 2026

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

combinatorial construction · 1.0
YearPublicationVenuePosition
2026 On Zero Skip-Cost Generalized Fractional-Repetition Codes from Covering Designs
abstract
We study generalized fractional repetition codes that have zero skip cost, and which are based on covering designs. We show that a zero skip cost is always attainable, perhaps at a price of an expansion factor compared with the optimal size of fractional repetition codes based on Steiner systems. We provide three constructions, as well as show non-constructively, that no expansion is needed for all codes based on sufficiently large covering systems.
Bo-Jun Yuan, Moshe Schwartz 0001
 ISIT2
2026 On Zero Skip-Cost Generalized Fractional-Repetition Codes From Covering Designs
abstract
We study generalized fractional repetition codes that have zero skip cost, and which are based on covering designs. We show that a zero skip cost is always attainable, perhaps at a price of an expansion factor compared with the optimal size of fractional repetition codes based on Steiner systems. We provide three constructions, as well as show non-constructively, that no expansion is needed for all codes based on sufficiently large covering systems.
Bo-Jun Yuan, Moshe Schwartz 0001
 IEEE Trans. Inf. Theory2
2025 The number of dissociation sets in connected graphs
Bo-Jun Yuan, Hong-Yan Ge, Shi-Cai Gong
 Discret. Appl. Math.1