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

Gerhard Wustmann

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

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

Systems, architecture and hardware · 2 · 2 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 · 63% Information theory · 37%
Computer networks
1 paper
Physical-layer communications · 100%

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

TopicWeightPapersLastEvidence papers
Information theory › probability theory › stochastic processes
autocorrelation function
0.021982
Autocorrelation Function of Filtered p-Level Maximal-Length Sequences · IEEE Trans. Computers 1982
Comments on "Autocorrelation Function of Sequential M-Bit Words Taken from an N-Bit Shift Register (PN) Sequence" · IEEE Trans. Computers 1981
Coding theory › sequences
pseudorandom sequences
0.021982
Autocorrelation Function of Filtered p-Level Maximal-Length Sequences · IEEE Trans. Computers 1982
Comments on "Autocorrelation Function of Sequential M-Bit Words Taken from an N-Bit Shift Register (PN) Sequence" · IEEE Trans. Computers 1981
Coding theory › sequences › pseudorandom sequences
m-sequences
0.011982
Autocorrelation Function of Filtered p-Level Maximal-Length Sequences · IEEE Trans. Computers 1982
Physical-layer communications
signal processing for communications
0.011982
Autocorrelation Function of Filtered p-Level Maximal-Length Sequences · IEEE Trans. Computers 1982
Coding theory › sequences › linear recurrence sequences
shift register sequences
0.011981
Comments on "Autocorrelation Function of Sequential M-Bit Words Taken from an N-Bit Shift Register (PN) Sequence" · IEEE Trans. Computers 1981

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

correlation analysis · 0.0
YearPublicationVenuePosition
1982 Autocorrelation Function of Filtered p-Level Maximal-Length Sequences
abstract
The autocorrelation function of nonrecursive digital filtered pseudorandom p-level (p = 2,3,5) maximal-length sequences is discussed. An extension to results given in the literature for summed binary sequences is presented and simple expressions for the correlation functions of higher level m-sequences are obtained.
Gerhard Wustmann
IEEE Trans. Computers1
1981 Comments on "Autocorrelation Function of Sequential M-Bit Words Taken from an N-Bit Shift Register (PN) Sequence"
abstract
This note suggests that the result by D. R. Morgan1is already covered by a more general solution obtained in [1] by A. R. Pratt. There the general problem of computing the autocovariance function of linearly weighted words from maximum length pseudorandom sequences is solved.
Gerhard Wustmann
IEEE Trans. Computers1