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
Demo Data from VLDB 2026 / reviewers in the wild / expert

J. D'Souza

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

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

Computer networks · 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
1 paper
Physical-layer communications · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications
channel coding		 0.011999
On low complexity stack decoding of convolutional codes · IEEE Trans. Commun. 1999
Physical-layer communications › channel coding › error control coding
convolutional codes		 0.011999
On low complexity stack decoding of convolutional codes · IEEE Trans. Commun. 1999
Physical-layer communications › channel coding › convolutional decoding
sequential decoding		 0.011999
On low complexity stack decoding of convolutional codes · IEEE Trans. Commun. 1999

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

stack algorithm · 0.0
YearPublicationVenuePosition
1999 On low complexity stack decoding of convolutional codes
abstract
This article presents techniques for improving the distribution of the number of stack entries, for stack sequential decoding over a hard quantized channel, with emphasis on high rate codes. It is shown that, for a class of high rate b/(b+1) codes, a table-based true high rate approach can be easily implemented for obtaining a decoding advantage over the punctured approach. Modified algorithms, which significantly improve the distribution of the number of stack entries and decoding time, are proposed for rate 1/N codes and high rate b/(b+1) codes.
J. D'Souza, Shankar Lall Maskara
 IEEE Trans. Commun.1