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

Yi-Hean Lin

dblp:163/8062 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2015
—ORCID · none

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

Theory of computation · 2Security and privacy · 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 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › sequences › sequence design
conflict-avoiding codes		 0.112010
Optimal Conflict-Avoiding Codes of Even Length and Weight 3 · IEEE Trans. Inf. Theory 2010
Coding theory › sequences
sequence design		 0.012010
Optimal Conflict-Avoiding Codes of Even Length and Weight 3 · IEEE Trans. Inf. Theory 2010

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

direct construction · 0.1
YearPublicationVenuePosition
2015 Weighted maximum matchings and optimal equi-difference conflict-avoiding codes
Yuan-Hsun Lo, Hung-Lin Fu, Yi-Hean Lin
 Des. Codes Cryptogr.3
2011 Errata to "Optimal Conflict-Avoiding Codes of Even Length and Weight 3"
abstract
In the above titled paper (ibid., vol. 56, pp. 5747-5756, Nov. 2010), the following corrections are necessary.
Hung-Lin Fu, Yi-Hean Lin, Miwako Mishima
 IEEE Trans. Inf. Theory2
2010 Optimal Conflict-Avoiding Codes of Even Length and Weight 3
abstract
Direct constructions for optimal conflict-avoiding codes of length$n \equiv 4 \pmod{8}$and weight 3 are provided by bringing in a new concept called an extended odd sequence. Constructions for those odd sequences are also given in this paper. As a consequence, with previously known results, the spectrum of the size of optimal conflict-avoiding codes of even length and weight 3 is completely settled.
Hung-Lin Fu, Yi-Hean Lin, Miwako Mishima
 IEEE Trans. Inf. Theory2