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

Howard I. Silver

dblp:134/4302 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1972
—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
Information theory · 46% Coding theory · 26% Mathematical optimization · 22%

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

TopicWeightPapersLastEvidence papers
Information theory › signal processing
signal design
0.021972
A class of discrete signal-design problems in burst noise · IEEE Trans. Inf. Theory 1972
A class of continuous signal-design problems in burst noise · IEEE Trans. Inf. Theory 1970
Mathematical optimization
discrete optimization
0.011972
A class of discrete signal-design problems in burst noise · IEEE Trans. Inf. Theory 1972
Mathematical optimization › numerical analysis
eigenvalue analysis
0.011972
A class of discrete signal-design problems in burst noise · IEEE Trans. Inf. Theory 1972
Algorithmic game theory and mechanism design › non-cooperative game
differential game
0.011970
A class of continuous signal-design problems in burst noise · IEEE Trans. Inf. Theory 1970
Mathematical optimization › control theory
optimal control
0.011970
A class of continuous signal-design problems in burst noise · IEEE Trans. Inf. Theory 1970

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

monte carlo evaluation · 0.0eigenvalue approach · 0.0two-player differential game · 0.0optimization with energy constraints · 0.0
YearPublicationVenuePosition
1972 A class of discrete signal-design problems in burst noise
abstract
The design of useful signaling alphabets in a burst-noise environment is treated as a discrete signal-design problem. A binary alphabet with minimum Gabor bandwidth is formulated as a discrete optimization problem to illustrate the design philosophy. The solution is obtained by using an eigenvalue approach. This technique is extended to the design of signals in a burst-noise environment where the burst is simulated by the removal of samples. Higher order alphabets are constructed for specific sample sizes and their performance evaluated.
Howard I. Silver, Ludwik Kurz
IEEE Trans. Inf. Theory1
1970 A class of continuous signal-design problems in burst noise
abstract
In this paper, signal design in a burst-noise environment is considered. Two distinct approaches are presented, each resulting in a class of signals for which the trade-off between signal bandwidth and immunity to large-amplitude bursts is shown. In the first approach the design is treated as an optimization problem subject to energy and endpoint constraints in a fixed time interval, and a uniform probability distribution of the location of the burst within the interval. The second approach considers signal design as a two-player differential game, where design flexibliity is obtained through the second player's choice of an initial value in the resulting differential equation. Performance curves for signals designed by using both methods are compared. It is shown how the first design procedure is easily extended toM-ary alphabets, thus obtaining the full advantage of the proposed technique.
Howard I. Silver, Ludwik Kurz
IEEE Trans. Inf. Theory1