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

A. L. Rubin

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

Computer networks
1 paper
Physical-layer communications · 100%
Theoretical computer science
1 paper
Information theory · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › relaying › relay systems
repeater
0.011984
The capacity of digital links in tandem · IEEE Trans. Inf. Theory 1984
Information theory
channel capacity
0.011984
The capacity of digital links in tandem · IEEE Trans. Inf. Theory 1984

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

asymptotic capacity analysis · 0.0
YearPublicationVenuePosition
1984 The capacity of digital links in tandem
abstract
Suppose we haveLdigital links in tandem. Between successive links we have a repeater. The links are each white Gaussian channels with no bandwidth constraint. The repeater may either be a {\em binary repeater}, which sends on each bit separately having made a binary decision on each, or a {\em Shannon repeater}, which perfectly reproduces at one end the bits that were transmitted at the other end of the link. What is the loss in capacity if we use only binary repeaters and code for the entire L links at the transmit end? For largeL, the capacity drops by a factor asymptotic to InL, and the normalized optimum timeTper symbolT_{\opt}^{L}is also asymptotic to\ln L. Arbitrarily shortLgives0capacity forL > 1. More precise asymptotic results are obtained and compared with computed numerical values. These results show when it pays to code each link separately in digital data transmission.
Edward C. Posner, A. L. Rubin
IEEE Trans. Inf. Theory2