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

M. G. Mulligan

dblp:43/1541 · DBLP profile ↗
← Back
1ranked-venue papers
1as 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 · 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.

Theoretical computer science
1 paper
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › coded modulation
continuous phase modulation		 0.011984
An improved algorithm for evaluating trellis phase codes · IEEE Trans. Inf. Theory 1984
Coding theory
trellis codes		 0.011984
An improved algorithm for evaluating trellis phase codes · IEEE Trans. Inf. Theory 1984

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

minimum distance evaluation · 0.0
YearPublicationVenuePosition
1984 An improved algorithm for evaluating trellis phase codes
abstract
A method is described for evaluating the minimum distance parameters of trellis-phase codes, including continuous phase frequency shift keying (CPFSK), partial-response FM, and, more importantly, coded continuous-phase modulation (CPM) schemes. The algorithm provides dramatically faster execution times and smaller memory requirements than previous algorithms. Results of sample calculations and timing comparisons are included.
M. G. Mulligan, Stephen G. Wilson
 IEEE Trans. Inf. Theory1