Demo Data from SIGIR 2026 / reviewers in the wild / expert
Branko Radosavljevic
dblp:20/615
· 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
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 · 91% Information theory · 9% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory
channel coding |
0.0 | 1 | 1992 | Sequential decoding of low-density parity-check codes by adaptive reordering of parity checks · IEEE Trans. Inf. Theory 1992 |
Coding theory › error-correcting codes
LDPC codes |
0.0 | 1 | 1992 | Sequential decoding of low-density parity-check codes by adaptive reordering of parity checks · IEEE Trans. Inf. Theory 1992 |
Coding theory › error-correcting codes › decoding
sequential decoding |
0.0 | 1 | 1992 | Sequential decoding of low-density parity-check codes by adaptive reordering of parity checks · IEEE Trans. Inf. Theory 1992 |
Information theory › communication channels › channel models › binary-input channel
binary erasure channel |
0.0 | 1 | 1992 | Sequential decoding of low-density parity-check codes by adaptive reordering of parity checks · IEEE Trans. Inf. Theory 1992 |
Methods — techniques the papers use, named apart from their topics
tree search · 0.0adaptive reordering · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1992 | Sequential decoding of low-density parity-check codes by adaptive reordering of parity checksabstractDecoding algorithms in which unpruned codeword trees are generated from an ordered list of parity checks are investigated. The order is computed from the received message, and low-density parity-check codes are used to help control the growth of the tree. Simulation results are given for the binary erasure channel. They suggest that for the small erasure probability, the method is computationally feasible at rates above the computational cutoff rate.> Branko Radosavljevic, Erdal Arikan, Bruce E. Hajek |
IEEE Trans. Inf. Theory | 1 |