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.

Chantal Paquin

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

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
convolutional codes
0.011990
Further results on high-rate punctured convolutional codes for Viterbi and sequential decoding · IEEE Trans. Commun. 1990
Coding theory › error-correcting codes › convolutional codes
punctured convolutional codes
0.011990
Further results on high-rate punctured convolutional codes for Viterbi and sequential decoding · IEEE Trans. Commun. 1990
Coding theory › error-correcting codes › convolutional codes › convolutional code decoding
viterbi decoding
0.011990
Further results on high-rate punctured convolutional codes for Viterbi and sequential decoding · IEEE Trans. Commun. 1990
Coding theory › error-correcting codes
weight distribution
0.011990
Further results on high-rate punctured convolutional codes for Viterbi and sequential decoding · IEEE Trans. Commun. 1990
Coding theory › error-correcting codes › decoding
sequential decoding
0.011990
Further results on high-rate punctured convolutional codes for Viterbi and sequential decoding · IEEE Trans. Commun. 1990

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

weight spectrum evaluation · 0.0
YearPublicationVenuePosition
1990 Further results on high-rate punctured convolutional codes for Viterbi and sequential decoding
abstract
The weight spectra of high-rate lpunctured convolutional codes are evaluated under the hypothesis of a low-rate structure. This interpretation yields results slightly different from those obtained when weight spectra are evaluated assuming a true high-rate structure for punctured codes. The search for long memory punctured codes is extended by providing new punctured codes of rates 4/5, 5/6, 6/7, and 7/8 with memories ranging from 9 to 19.>
Guy Bégin, David Haccoun, Chantal Paquin
IEEE Trans. Commun.3