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

Brenden Wong

dblp:119/4771 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1995
—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 · 77% Information theory · 23%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
error detection		 0.011995
On computing undetected error probabilities on the Gilbert channel · IEEE Trans. Commun. 1995
Coding theory › error-correcting codes › error detection
undetected error probability		 0.011995
On computing undetected error probabilities on the Gilbert channel · IEEE Trans. Commun. 1995
Information theory › communication channels
channel models		 0.011995
On computing undetected error probabilities on the Gilbert channel · IEEE Trans. Commun. 1995
Information theory › channel capacity › state-dependent channel › finite-state channel
gilbert channel		 0.011995
On computing undetected error probabilities on the Gilbert channel · IEEE Trans. Commun. 1995

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

cyclic redundancy code analysis · 0.0
YearPublicationVenuePosition
1995 On computing undetected error probabilities on the Gilbert channel
abstract
Two methods for computing the probability of undetected error on the Gilbert (1960) channel are examined. First, using a method proposed by Kittel (1978), we study some standard cyclic redundancy codes and compare the results with those on the binary symmetric channel. Then we consider a general method of approximate code evaluation, proposed by Elliott, which involves P(m, n), the probability of m errors in a block of length n bits. A nonrecursive technique for computing P(m, n) on the Gilbert channel is described.
Brenden Wong, Cyril Leung
 IEEE Trans. Commun.1