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.
EDBT 2026 Demo / reviewers in the wild / expert

Byung Gyun Kang

dblp:56/10045 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2012
—ORCID · unresolved

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
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
constant-weight codes		 0.112012
Delsarte's Linear Programming Bound for Constant-Weight Codes · IEEE Trans. Inf. Theory 2012
Coding theory › error-correcting codes › coding bounds
linear programming bounds		 0.112012
Delsarte's Linear Programming Bound for Constant-Weight Codes · IEEE Trans. Inf. Theory 2012

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

linear programming · 0.1delsarte's bound · 0.1
YearPublicationVenuePosition
2012 Delsarte's Linear Programming Bound for Constant-Weight Codes
abstract
We give an alternative proof of Delsarte's linear programming bound for binary codes and its improvements. Applying the technique which is used in the proof to binary constant-weight codes, we obtain new upper bounds on sizes of binary constant-weight codes.
Byung Gyun Kang, Hyun Kwang Kim, Phan Thanh Toan
 IEEE Trans. Inf. Theory1