EDBT 2026 Demo / reviewers in the wild / expert
Chia-Ning Peng
dblp:46/2055
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2000
—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 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes › coded modulation
block-coded modulation |
0.0 | 1 | 2000 | Rate gains in block-coded modulation systems with interblock memory · IEEE Trans. Inf. Theory 2000 |
Coding theory
channel coding |
0.0 | 1 | 2000 | Rate gains in block-coded modulation systems with interblock memory · IEEE Trans. Inf. Theory 2000 |
Coding theory › error-correcting codes
coded modulation |
0.0 | 1 | 2000 | Rate gains in block-coded modulation systems with interblock memory · IEEE Trans. Inf. Theory 2000 |
Coding theory
coding gain |
0.0 | 1 | 2000 | Rate gains in block-coded modulation systems with interblock memory · IEEE Trans. Inf. Theory 2000 |
Coding theory › error-correcting codes › coded modulation › block-coded modulation
interblock memory |
0.0 | 1 | 2000 | Rate gains in block-coded modulation systems with interblock memory · IEEE Trans. Inf. Theory 2000 |
Methods — techniques the papers use, named apart from their topics
normalized distance design · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2000 | Rate gains in block-coded modulation systems with interblock memoryabstractThis paper examines the performance gains achievable by adding interblock memory to, and altering the mapping of coded bits to symbols in, block-coded modulation systems. The channel noise considered is additive Gaussian, and the twin design goals are to maximize the asymptotic coding gain and to minimize the number of apparent nearest neighbors. In the case of the additive white Gaussian noise channel, these goals translate into the design of block codes of a given weighted or 'normalized' distance whose rate is as high as possible, and whose number of codewords at minimum normalized distance is low. The effect of designing codes for normalized distance rather than Hamming distance is to ease the problem of determining the best codes for given parameters in the cases of greatest interest, and many such best codes are given. Chia-Ning Peng, Houshou Chen, John T. Coffey, Richard G. C. Williams |
IEEE Trans. Inf. Theory | 1 |