EDBT 2026 Demo / reviewers in the wild / expert

M. C. Cheng

dblp:96/6421 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2001
—ORCID · none

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

Theory of computation · 3 · 2 first-authorArtificial intelligence and machine learning · 1Databases, data management, data science and information retrieval · 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
3 papers
Information theory · 65% Coding theory · 35%

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

TopicWeightPapersLastEvidence papers
Information theory
channel capacity		 0.021974
On the Computation of Capacity of Discrete Memoryless Channel · Inf. Control. 1974
On Capacity and Random Coding Exponent of a DMC · Inf. Control. 1973
Information theory › communication channels › channel models
discrete memoryless channel		 0.021974
On the Computation of Capacity of Discrete Memoryless Channel · Inf. Control. 1974
On Capacity and Random Coding Exponent of a DMC · Inf. Control. 1973
Coding theory › error-correcting codes › block codes
product codes		 0.011975
Cyclic mappings of product codes (Corresp.) · IEEE Trans. Inf. Theory 1975
Coding theory › channel coding › error exponent
random coding exponent		 0.011973
On Capacity and Random Coding Exponent of a DMC · Inf. Control. 1973

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

cyclic mapping · 0.0
YearPublicationVenuePosition
2001 Using Networked Workshop System to Enhance Creative Design
Sunny S. J. Lin, Eric Zhi-Feng Liu, M. C. Cheng, Shyan-Ming Yuan
 Web Intelligence3
1975 Cyclic mappings of product codes (Corresp.)
abstract
We generalize Burton and Weldon's result by presenting two cyclic mappings which are one-to-one maps and which, forN_1andN_2relatively prime andaandbpositive integers, i) maps each ofab N_1 \times N_2product codes into the same cyclic code of lengthN_1N_2and at the same time orders them to form a cyclic code; and ii) maps each ofab N_1 \times N_2product codes into a cyclic code of lengthN_1N_2and at the same time orders theseabcyclic codes in such a way as to form a cyclic code.
Y. L. Lee, M. C. Cheng
 IEEE Trans. Inf. Theory2
1974 On the Computation of Capacity of Discrete Memoryless Channel
M. C. Cheng
 Inf. Control.1
1973 On Capacity and Random Coding Exponent of a DMC
M. C. Cheng
 Inf. Control.1