EDBT 2026 Demo / reviewers in the wild / expert
Chungming Tu
dblp:79/3896
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 1994
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2
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
2 papers |
Coding theory · 46% Combinatorics and discrete mathematics · 27% Information theory · 27% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Combinatorics and discrete mathematics
combinatorial design |
0.0 | 1 | 1994 | New bounds for the sizes of radar arrays · IEEE Trans. Inf. Theory 1994 |
Information theory › signal processing › array processing
radar arrays |
0.0 | 1 | 1994 | New bounds for the sizes of radar arrays · IEEE Trans. Inf. Theory 1994 |
Coding theory
error-correcting codes |
0.0 | 1 | 1993 | On the construction of systematic tEC/AUED codes · IEEE Trans. Inf. Theory 1993 |
Coding theory › error-correcting codes › error detection and correction › multiple error correction
tEC/AUED codes |
0.0 | 1 | 1993 | On the construction of systematic tEC/AUED codes · IEEE Trans. Inf. Theory 1993 |
Methods — techniques the papers use, named apart from their topics
window method · 0.0computer search · 0.0code construction · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1994 | New bounds for the sizes of radar arraysabstractImproved upper bounds for the size of radar arrays are found by using the window method. New general constructions and computer-searched examples are presented. The radar array problem is generalized to include arrays with sidelobes greater than 1.> Zhen Zhang 0010, Chungming Tu |
IEEE Trans. Inf. Theory | 2 |
| 1993 | On the construction of systematic tEC/AUED codesabstractA new approach for the construction of systematic tEC/AUED codes is presented. These new constructions improve many values of the upper bound on the redundancy of the code for t=1 and 2.> Zhen Zhang 0010, Chungming Tu |
IEEE Trans. Inf. Theory | 2 |