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

J. L. Devore

dblp:134/6361 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1974
—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

TopicWeightPapersLastEvidence papers
Coding theory
channel coding		 0.011974
A note on the observation of a Markov source through a noisy channel (Corresp.) · IEEE Trans. Inf. Theory 1974
Coding theory › error-correcting codes › decoding › channel decoding
noisy channel decoding		 0.011974
A note on the observation of a Markov source through a noisy channel (Corresp.) · IEEE Trans. Inf. Theory 1974
Coding theory
source coding		 0.011974
A note on the observation of a Markov source through a noisy channel (Corresp.) · IEEE Trans. Inf. Theory 1974
Information theory › probability theory › stochastic processes
markov processes		 0.011974
A note on the observation of a Markov source through a noisy channel (Corresp.) · IEEE Trans. Inf. Theory 1974

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

sequential decoding · 0.0optimality conditions · 0.0nonsequential decoding · 0.0
YearPublicationVenuePosition
1974 A note on the observation of a Markov source through a noisy channel (Corresp.)
abstract
A signal is sent by a two-state Markov source through a noisy channel. The objective is to develop a decoding scheme to obtain a reconstruction of the original signal. Necessary and sufficient conditions are presented, in both a sequential and a nonsequential context, for the optimality of several decoding schemes, including the singlet decoding rule and the data-independent decoding rule. A generalization of the simple noise process given by Drake [1] is presented, and analogous results are derived.
J. L. Devore
 IEEE Trans. Inf. Theory1