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 SIGIR 2026 / reviewers in the wild / expert

Joon Yop Lee

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

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

Theory of computation · 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 › insertion and deletion › insertion-deletion channel
deletion-correcting codes		 0.112010
Optimal single deletion correcting code of length four over an alphabet of even size · IEEE Trans. Inf. Theory 2010
Coding theory › error-correcting codes › coding bounds › code size bounds
levenshtein bound		 0.112010
Optimal single deletion correcting code of length four over an alphabet of even size · IEEE Trans. Inf. Theory 2010
Coding theory › error-correcting codes
optimal codes		 0.112010
Optimal single deletion correcting code of length four over an alphabet of even size · IEEE Trans. Inf. Theory 2010

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

upper bound improvement · 0.1perfect code construction · 0.1
YearPublicationVenuePosition
2010 Optimal single deletion correcting code of length four over an alphabet of even size
abstract
We improve Levenshtein's upper bound for the cardinality of a code of length four that is capable of correcting single deletions over an alphabet of even size. We also illustrate that the new upper bound is sharp. Furthermore we construct an optimal perfect code that is capable of correcting single deletions for the same parameters.
Hyun Kwang Kim, Joon Yop Lee, Dong Yeol Oh
 IEEE Trans. Inf. Theory2