Demo Data from EDBT 2026 / reviewers in the wild / expert
Margaret Ann Bernard
dblp:28/6389
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 1997
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 1 · 1 first-authorTheory 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 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › source coding › variable-length codes
average length bounds |
0.0 | 1 | 1990 | A lower bound on average crowded length of variable length error-correcting codes · IEEE Trans. Inf. Theory 1990 |
Coding theory
error-correcting codes |
0.0 | 1 | 1990 | A lower bound on average crowded length of variable length error-correcting codes · IEEE Trans. Inf. Theory 1990 |
Coding theory
source coding |
0.0 | 1 | 1990 | A lower bound on average crowded length of variable length error-correcting codes · IEEE Trans. Inf. Theory 1990 |
Coding theory › source coding
variable-length codes |
0.0 | 1 | 1990 | A lower bound on average crowded length of variable length error-correcting codes · IEEE Trans. Inf. Theory 1990 |
Methods — techniques the papers use, named apart from their topics
shannon bound generalization · 0.0promptness criterion · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1997 | Linear Codes with Non-Uniform Error Correction Capability
Margaret Ann Bernard, Bhu Dev Sharma |
Des. Codes Cryptogr. | 1 |
| 1990 | A lower bound on average crowded length of variable length error-correcting codesabstractCodes of variable length that are capable of error correction are studied. A lower bound on the average length of such codes under the criterion of promptness is obtained. This generalizes the celebrated result due to C.E. Shannon (1948) for the noiseless case. The bound obtained provides a measure of optimality for variable-length, error-correcting codes.> Margaret Ann Bernard, Bhu Dev Sharma |
IEEE Trans. Inf. Theory | 1 |