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

Kelan Ding

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

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 · 61% Information theory · 39%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › block codes
linear code		 0.212015
A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing · IEEE Trans. Inf. Theory 2015
Information theory › information-theoretic security
secret sharing		 0.212015
A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing · IEEE Trans. Inf. Theory 2015
Coding theory › error-correcting codes
weight distribution		 0.212015
A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing · IEEE Trans. Inf. Theory 2015
Information theory › information-theoretic security
authentication codes		 0.112015
A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing · IEEE Trans. Inf. Theory 2015

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

linear code construction · 0.2
YearPublicationVenuePosition
2015 A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
abstract
In this paper, a class of two-weight and three-weight linear codes over GF(p) is constructed, and their application in secret sharing is investigated. Some of the linear codes obtained are optimal in the sense that they meet certain bounds on linear codes. These codes have applications also in authentication codes, association schemes, and strongly regular graphs, in addition to their applications in consumer electronics, communication and data storage systems.
Kelan Ding, Cunsheng Ding
 IEEE Trans. Inf. Theory1