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

Robert A. Rutledge

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

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

Theory of computation · 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 · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › error probability analysis
bit-error probability
0.011976
Bounds on the probability of error for convolutional codes (Corresp.) · IEEE Trans. Inf. Theory 1976
Coding theory › error-correcting codes
convolutional codes
0.011976
Bounds on the probability of error for convolutional codes (Corresp.) · IEEE Trans. Inf. Theory 1976
Coding theory › error-correcting codes
decoding
0.011976
Bounds on the probability of error for convolutional codes (Corresp.) · IEEE Trans. Inf. Theory 1976
Coding theory
error ball
0.011976
Bounds on the probability of error for convolutional codes (Corresp.) · IEEE Trans. Inf. Theory 1976
Coding theory › channel coding
error probability bounds
0.011976
Bounds on the probability of error for convolutional codes (Corresp.) · IEEE Trans. Inf. Theory 1976
YearPublicationVenuePosition
1976 Bounds on the probability of error for convolutional codes (Corresp.)
abstract
For the single error correcting convolutional codes introduced by Wyner and Ash, it is shown that if sufficiently few errors occur in an appropriate neighborhood of a block, the probability of correctly decoding that block is independent of errors outside that neighborhood. This fact is used to derive bounds on the bit error probability and the mean time to first error.
Chin-Long Chen, Robert A. Rutledge
IEEE Trans. Inf. Theory2