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

Deshan Chang

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

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

Computer networks · 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 · 60% Transport protocols and congestion control · 40%

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

TopicWeightPapersLastEvidence papers
Transport protocols and congestion control › error control
automatic repeat request
0.011985
Efficient Selective Repeat ARQ Strategies for Very Noisy and Fluctuating Channels · IEEE Trans. Commun. 1985
Physical-layer communications
channel coding
0.011985
Efficient Selective Repeat ARQ Strategies for Very Noisy and Fluctuating Channels · IEEE Trans. Commun. 1985
Physical-layer communications › channel coding
hybrid ARQ
0.011985
Efficient Selective Repeat ARQ Strategies for Very Noisy and Fluctuating Channels · IEEE Trans. Commun. 1985
Physical-layer communications › channel coding › hybrid ARQ
memory ARQ
0.011985
Efficient Selective Repeat ARQ Strategies for Very Noisy and Fluctuating Channels · IEEE Trans. Commun. 1985
Transport protocols and congestion control › error control › automatic repeat request
selective repeat ARQ
0.011985
Efficient Selective Repeat ARQ Strategies for Very Noisy and Fluctuating Channels · IEEE Trans. Commun. 1985

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

soft combining · 0.0similarity test · 0.0rate 1/2 coding · 0.0
YearPublicationVenuePosition
1985 Efficient Selective Repeat ARQ Strategies for Very Noisy and Fluctuating Channels
abstract
This paper investigates memory and selective repeat ARQ techniques when channels in both directions are very noisy. It demonstrates that a difficulty arises when memory ARQ is used in these situations, and proposes a remedy-the similarity test. The paper considers a combination of both memory ARQ techniques where an unacknowledged block is retransmitted exactly as before, and modified memory ARQ where alternate transmissions together form a rate 1/2 code. The following items are featured. 1) Discussion and analysis of the similarity test. 2) A memory ARQ technique which employs double null zone reception and 3 bits of past information storage per binary digit. 3) For modified memory ARQ procedures, a discussion of how to resolve problems of confusing the identity of the two halves of the rate 1/2 code used.
John J. Metzner, Deshan Chang
IEEE Trans. Commun.2