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

Laurent R. Lugand

dblp:93/3586 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1989
—ORCID · none

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

Computer networks · 1 · 1 first-authorTheory 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.

Computer networks
2 papers
Physical-layer communications · 73% Transport protocols and congestion control · 27%
Theoretical computer science
1 paper
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Transport protocols and congestion control › error control
automatic repeat request
0.021989
Parity retransmission hybrid ARQ using rate 1/2 convolutional codes on a nonstationary channel · IEEE Trans. Commun. 1989
ARQ Schemes Using Convolutional codes and Viterbi Decoding over Nonstationary Channels · IEEE Trans. Inf. Theory 1985
Physical-layer communications › channel coding
hybrid ARQ
0.011989
Parity retransmission hybrid ARQ using rate 1/2 convolutional codes on a nonstationary channel · IEEE Trans. Commun. 1989
Coding theory
channel coding
0.011989
Parity retransmission hybrid ARQ using rate 1/2 convolutional codes on a nonstationary channel · IEEE Trans. Commun. 1989
Coding theory › error-correcting codes
convolutional codes
0.011989
Parity retransmission hybrid ARQ using rate 1/2 convolutional codes on a nonstationary channel · IEEE Trans. Commun. 1989
Coding theory › error-correcting codes › convolutional codes › convolutional code decoding
viterbi decoding
0.011989
Parity retransmission hybrid ARQ using rate 1/2 convolutional codes on a nonstationary channel · IEEE Trans. Commun. 1989
Physical-layer communications
channel coding
0.011985
ARQ Schemes Using Convolutional codes and Viterbi Decoding over Nonstationary Channels · IEEE Trans. Inf. Theory 1985
Physical-layer communications › channel coding › error control coding
convolutional codes
0.011985
ARQ Schemes Using Convolutional codes and Viterbi Decoding over Nonstationary Channels · IEEE Trans. Inf. Theory 1985
Physical-layer communications › channel coding › convolutional decoding
viterbi decoding
0.011985
ARQ Schemes Using Convolutional codes and Viterbi Decoding over Nonstationary Channels · IEEE Trans. Inf. Theory 1985
Physical-layer communications › channel modeling › time-varying channels
non-stationary channel
0.021989
Parity retransmission hybrid ARQ using rate 1/2 convolutional codes on a nonstationary channel · IEEE Trans. Commun. 1989
ARQ Schemes Using Convolutional codes and Viterbi Decoding over Nonstationary Channels · IEEE Trans. Inf. Theory 1985

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

throughput analysis · 0.0markov channel modeling · 0.0viterbi decoding · 0.0
YearPublicationVenuePosition
1989 Parity retransmission hybrid ARQ using rate 1/2 convolutional codes on a nonstationary channel
abstract
A parity retransmission hybrid automatic repeat request (ARQ) scheme is proposed which uses rate 1/2 convolutional codes and Viterbi decoding. A protocol is described which is capable of achieving higher throughputs than previously proposed parity retransmission schemes. The performance analysis is based on a two-state Markov model of a nonstationary channel. This model constitutes a first approximation to a nonstationary channel. The two-state channel model is used to analyze the throughput and undetected error probability of the protocol presented when the receiver has both an infinite and a finite buffer size. It is shown that the throughput improves as the channel becomes more bursty.>
Laurent R. Lugand, Daniel J. Costello Jr., Robert H. Deng
IEEE Trans. Commun.1
1985 ARQ Schemes Using Convolutional codes and Viterbi Decoding over Nonstationary Channels
Laurent R. Lugand
IEEE Trans. Inf. Theory1