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

Gary A. Wolf

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

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

Theory of computation · 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 · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
decoding
0.021974
The optimum mean-square estimate for decoding binary block codes · IEEE Trans. Inf. Theory 1974
The optimum mean-square estimate for decoding binary block codes (Ph.D. Thesis abstr.) · IEEE Trans. Inf. Theory 1974
Coding theory
error-correcting codes
0.021974
The optimum mean-square estimate for decoding binary block codes · IEEE Trans. Inf. Theory 1974
The optimum mean-square estimate for decoding binary block codes (Ph.D. Thesis abstr.) · IEEE Trans. Inf. Theory 1974
Coding theory › error-correcting codes › decoding
mean-square-error decoding
0.011974
The optimum mean-square estimate for decoding binary block codes · IEEE Trans. Inf. Theory 1974
Coding theory › error-correcting codes › block codes
binary block codes
0.021974
The optimum mean-square estimate for decoding binary block codes · IEEE Trans. Inf. Theory 1974
The optimum mean-square estimate for decoding binary block codes (Ph.D. Thesis abstr.) · IEEE Trans. Inf. Theory 1974

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

abstract fourier analysis on groups · 0.0abstract fourier analysis · 0.0
YearPublicationVenuePosition
1974 The optimum mean-square estimate for decoding binary block codes (Ph.D. Thesis abstr.)
Gary A. Wolf
IEEE Trans. Inf. Theory1
1974 The optimum mean-square estimate for decoding binary block codes
abstract
By the use of abstract Fourier analysis on groups, the optimum mean-square-error decoding rule is developed for a fixed block code. The optimum one-to-one coding role to be used with this optimum decoder is derived, and a procedure for simultaneous optimization over both encoding and decoding rules is given. It is shown that there is a linear encoding rule which is optimum. A system which implements the optimum decoding rule is outlined. The major difference between this work and others involving coding for mean-square error is that the decoding rule developed here is a mapping from binaryn-tuples directly into the real numbers with the optimization being over all possible mappings into the real numbers. As such the system developed here replaces both the error-correction and digital-to-analog conversion components used in most numerical data transmission systems.
Gary A. Wolf, G. Robert Redinbo
IEEE Trans. Inf. Theory1