Demo Data from EDBT 2026 / reviewers in the wild / expert
Eduardo Nisenbaum
dblp:60/1730
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1995
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 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
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
coding bounds |
0.0 | 1 | 1995 | Upper bounds and Hamming spheres under the DC constraint · IEEE Trans. Inf. Theory 1995 |
Coding theory
constrained coding |
0.0 | 1 | 1995 | Upper bounds and Hamming spheres under the DC constraint · IEEE Trans. Inf. Theory 1995 |
Coding theory › constrained coding › spectral-null codes
DC-constrained codes |
0.0 | 1 | 1995 | Upper bounds and Hamming spheres under the DC constraint · IEEE Trans. Inf. Theory 1995 |
Coding theory › error-correcting codes › coding bounds › minimum distance bounds
plotkin bound |
0.0 | 1 | 1995 | Upper bounds and Hamming spheres under the DC constraint · IEEE Trans. Inf. Theory 1995 |
Coding theory › error-correcting codes › coding bounds › packing bounds
sphere-packing bound |
0.0 | 1 | 1995 | Upper bounds and Hamming spheres under the DC constraint · IEEE Trans. Inf. Theory 1995 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1995 | Upper bounds and Hamming spheres under the DC constraintabstractUpper bounds on the rate of codes in DC-constrained spaces are derived for imbalances 3, 4, and 5. The new bounds are based on the identification and size calculation of the minimal Hamming spheres. A new combination of the Hamming and Plotkin (1960) bounds for constrained spaces is obtained.> Helio Waldman, Eduardo Nisenbaum |
IEEE Trans. Inf. Theory | 2 |