EDBT 2026 Demo / reviewers in the wild / expert
A. Trofimov
dblp:95/4933
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2004
—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 · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes › decoding › soft-decision decoding
APP decoding |
0.0 | 1 | 2004 | A memory-efficient optimal APP symbol-decoding algorithm for linear block codes · IEEE Trans. Commun. 2004 |
Coding theory › error-correcting codes › decoding › iterative decoding › soft-input soft-output decoding
BCJR algorithm |
0.0 | 1 | 2004 | A memory-efficient optimal APP symbol-decoding algorithm for linear block codes · IEEE Trans. Commun. 2004 |
Coding theory › error-correcting codes › block codes
linear block codes |
0.0 | 1 | 2004 | A memory-efficient optimal APP symbol-decoding algorithm for linear block codes · IEEE Trans. Commun. 2004 |
Coding theory
trellis |
0.0 | 1 | 2004 | A memory-efficient optimal APP symbol-decoding algorithm for linear block codes · IEEE Trans. Commun. 2004 |
Methods — techniques the papers use, named apart from their topics
forward-backward recursion · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2004 | A memory-efficient optimal APP symbol-decoding algorithm for linear block codesabstractWe propose a simple modification of the famous Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm for linear block codes. The modified algorithm requires one forward and two backward recursions in the code trellis, but eliminates the need to store the whole trellis. Compared with the BCJR algorithm, the computational complexity is slightly increased, but the storage requirement is reduced. A. Trofimov, Thomas Johansson 0001 |
IEEE Trans. Commun. | 1 |