Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
EDBT 2026 Demo / reviewers in the wild / expert

Boris Stender

dblp:12/689 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2004
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 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 · 78% Graph algorithms and graph theory · 22%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
decoding		 0.012004
An algorithm for detecting unreliable code sequence segments and its applications · IEEE Trans. Commun. 2004
Coding theory › error-correcting codes
error detection		 0.012004
An algorithm for detecting unreliable code sequence segments and its applications · IEEE Trans. Commun. 2004
Graph algorithms and graph theory › network analysis
reliability estimation		 0.012004
An algorithm for detecting unreliable code sequence segments and its applications · IEEE Trans. Commun. 2004
Coding theory › error-correcting codes › convolutional codes › convolutional code decoding
viterbi decoding		 0.012004
An algorithm for detecting unreliable code sequence segments and its applications · IEEE Trans. Commun. 2004
Coding theory › error-correcting codes › hybrid ARQ
automatic repeat request		 0.012004
An algorithm for detecting unreliable code sequence segments and its applications · IEEE Trans. Commun. 2004
Coding theory
retransmission		 0.012004
An algorithm for detecting unreliable code sequence segments and its applications · IEEE Trans. Commun. 2004

Methods — techniques the papers use, named apart from their topics

viterbi algorithm · 0.0trellis decoding · 0.0
YearPublicationVenuePosition
2004 An algorithm for detecting unreliable code sequence segments and its applications
abstract
Let the Viterbi algorithm be applied for maximum-likelihood decoding of a terminated convolutional code using a trellis. We propose an additional procedure that permits a receiver to locate unreliable segments within an estimated code sequence. This reliability output may be used, for example, to request retransmissions, in systems with error concealment, or in channel-coding systems with unequal error protection.
Jürgen Freudenberger, Boris Stender
 IEEE Trans. Commun.2