Demo Data from EDBT 2026 / reviewers in the wild / expert
Shad Laufer
dblp:122/6596
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1992
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 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 · 54% Information theory · 46% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information theory › network information theory › interference channel
block-interference channel |
0.0 | 1 | 1992 | A short-coding error parameter for channels with block interference · IEEE Trans. Commun. 1992 |
Information theory › communication channels
channel models |
0.0 | 1 | 1992 | A short-coding error parameter for channels with block interference · IEEE Trans. Commun. 1992 |
Coding theory › channel coding › error exponent
cutoff rate |
0.0 | 1 | 1992 | A short-coding error parameter for channels with block interference · IEEE Trans. Commun. 1992 |
Coding theory › channel coding › error exponent
error exponent analysis |
0.0 | 1 | 1992 | A short-coding error parameter for channels with block interference · IEEE Trans. Commun. 1992 |
Coding theory › error-correcting codes › error probability analysis
decoding error probability |
0.0 | 1 | 1992 | A short-coding error parameter for channels with block interference · IEEE Trans. Commun. 1992 |
Methods — techniques the papers use, named apart from their topics
error probability bounding · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1992 | A short-coding error parameter for channels with block interferenceabstractA short-coding error parameter (SCEP) that provides a bound on the average probability of decoding error for codes with length shorter than the memory length is presented. It is shown that this bound is tighter than the bound based on the conventional cutoff rate and that the SCEP is independent of the channel's memory length, provided the codeword length is shorter than the memory length.> Shad Laufer, Jakov Snyders |
IEEE Trans. Commun. | 1 |