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 EDBT 2026 / reviewers in the wild / expert

H. Manley

dblp:82/10571 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1980
—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 · 60% Algorithms and data structures · 40%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
algebraic coding theory		 0.011980
Some applications of Good's theorem (Corresp.) · IEEE Trans. Inf. Theory 1980
Coding theory › error-correcting codes
decoding		 0.011980
Some applications of Good's theorem (Corresp.) · IEEE Trans. Inf. Theory 1980
Algorithms and data structures › signal processing algorithms
discrete fourier transform		 0.011980
Some applications of Good's theorem (Corresp.) · IEEE Trans. Inf. Theory 1980
Coding theory › error-correcting codes
reed-muller codes		 0.011980
Some applications of Good's theorem (Corresp.) · IEEE Trans. Inf. Theory 1980
Algorithms and data structures › linear algebra › linear algebra algorithms › fast transforms
walsh-hadamard transform		 0.011980
Some applications of Good's theorem (Corresp.) · IEEE Trans. Inf. Theory 1980

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

good's theorem · 0.0
YearPublicationVenuePosition
1980 Some applications of Good's theorem (Corresp.)
abstract
Three applications of a theorem of I. J. Good are made: a simplification of the fast Hadamard transform algorithm of R.R. Green used in the decoding of first-order Reed-Muller codes, a simple proof of the well-known Parseval formula, and an application to the discrete one-dimensional Fourier transform.
H. Manley, Harold F. Mattson, James R. Schatz
 IEEE Trans. Inf. Theory1