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.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Niels J. C. Lous

dblp:83/2177 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1993
—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 · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › block codes › linear code
binary linear codes		 0.011993
On maximum likelihood soft-decision decoding of binary linear codes · IEEE Trans. Inf. Theory 1993
Coding theory › error-correcting codes › decoding
decoding algorithms		 0.011993
On maximum likelihood soft-decision decoding of binary linear codes · IEEE Trans. Inf. Theory 1993
Coding theory › error-correcting codes › decoding › decoding algorithms › optimal decoding
maximum-likelihood decoding		 0.011993
On maximum likelihood soft-decision decoding of binary linear codes · IEEE Trans. Inf. Theory 1993
Coding theory › error-correcting codes › decoding
soft-decision decoding		 0.011993
On maximum likelihood soft-decision decoding of binary linear codes · IEEE Trans. Inf. Theory 1993

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

column pattern enumeration · 0.0branching and bounding · 0.0
YearPublicationVenuePosition
1993 On maximum likelihood soft-decision decoding of binary linear codes
abstract
Two new implementations of a maximum-likelihood soft-decision decoding algorithm for binary linear codes are derived. Instead of checking only error patterns yielding a codeword when added to the rounded-off version of the received vector, these implementations principally consider all possible column patterns. Compared to known implementations, this allows a more efficient use of branching and bounding techniques.>
Niels J. C. Lous, Patrick A. H. Bours, Henk C. A. van Tilborg
 IEEE Trans. Inf. Theory1