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

Thomas P. McGree

dblp:31/4455 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1984
—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.

Theoretical computer science
2 papers
Coding theory · 65% Information theory · 35%
Computer networks
1 paper
Physical-layer communications · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › signal sets
signal set design
0.011984
Upper bounds and construction techniques for signal sets with constrained synchronous correlation and specified time-bandwidth product · IEEE Trans. Inf. Theory 1984
Information theory › signal processing › time-frequency analysis
time-bandwidth product
0.011984
Upper bounds and construction techniques for signal sets with constrained synchronous correlation and specified time-bandwidth product · IEEE Trans. Inf. Theory 1984
Physical-layer communications
signal design
0.011983
Signal Sets with Optimal Correlation Properties · IEEE Trans. Commun. 1983
Coding theory › sequences › sequence design
correlation properties
0.011983
Signal Sets with Optimal Correlation Properties · IEEE Trans. Commun. 1983

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

upper bounds · 0.0construction techniques · 0.0
YearPublicationVenuePosition
1984 Upper bounds and construction techniques for signal sets with constrained synchronous correlation and specified time-bandwidth product
abstract
Upper bounds are presented on the size of equal energy continuous time signal sets occupying a given time-bandwidth (TB) product under specified synchronous correlation constraints. Both time-limited (aperiodic) and periodic signal sets are addressed, with appropriate measures of bandwidth for each. Signal set construction techniques are derived which illustrate that the bounds for periodic signal sets are relatively tight, while those obtained for aperiodic signal sets are tight under certain conditions.
Thomas P. McGree, George R. Cooper
IEEE Trans. Inf. Theory1
1983 Signal Sets with Optimal Correlation Properties
abstract
Rowe has developed an upper bound on the number of vectors possible in ad-dimensional space, given that the vectors of the set are divided into orthogonal alphabets and subject to an appropriately defined root-mean-square correlation constraint Crms. Here, signal set design procedures are presented that are near optimal with respect to Rowe's upper bound. The specific parameters of these signal set construction techniques are significant as they illustrate the tightness of the upper bound for situations that have not been previously addressed. Finally, a signal set design procedure is presented that serves as an improvement to a lower bound originally reported by Rowe.
Thomas P. McGree
IEEE Trans. Commun.1