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

Oscar S. Rothaus

dblp:57/858 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1993
—ORCID · none

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

Systems, architecture and hardware · 1Theory 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 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory
error-correcting codes
0.011993
Modified Gold codes · IEEE Trans. Inf. Theory 1993
Coding theory › sequences › pseudorandom sequences
gold codes
0.011993
Modified Gold codes · IEEE Trans. Inf. Theory 1993

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

simplified proof method · 0.0
YearPublicationVenuePosition
1993 Modified Gold codes
abstract
Large families of weakly correlated codes, much in the spirit of R. Gold (1967) and T. Kasami (1971), are constructed. More general codes than those of Gold and Kasami, generated in essentially the same way, and with a much simpler method of proof, are given.>
Oscar S. Rothaus
IEEE Trans. Inf. Theory1
1985 Fast fourier transform processors using Gaussian residue arithmetic
Alvin M. Despain, Allen M. Peterson, Oscar S. Rothaus, Erling Wold
J. Parallel Distributed Comput.3