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

Michael J. Steiner

dblp:78/10956 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 1997
0000-0003-3199-0935ORCID · verified

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

Theory of computation · 2 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1

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 · 80% Information theory · 20%
Computer networks
1 paper
Physical-layer communications · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications
detection theory
0.011994
The strong simplex conjecture is false · IEEE Trans. Inf. Theory 1994
Physical-layer communications
error probability analysis
0.011994
The strong simplex conjecture is false · IEEE Trans. Inf. Theory 1994
Physical-layer communications
signal design
0.011994
The strong simplex conjecture is false · IEEE Trans. Inf. Theory 1994
Physical-layer communications › signal design
simplex signal structures
0.011994
The strong simplex conjecture is false · IEEE Trans. Inf. Theory 1994
Coding theory
channel coding
0.011994
Constructive codes for arbitrary discrete memoryless channels · IEEE Trans. Inf. Theory 1994
Coding theory › error-correcting codes
concatenated codes
0.011994
Constructive codes for arbitrary discrete memoryless channels · IEEE Trans. Inf. Theory 1994
Information theory › communication channels › channel models
discrete memoryless channel
0.011994
Constructive codes for arbitrary discrete memoryless channels · IEEE Trans. Inf. Theory 1994
Coding theory › channel coding
error exponent
0.011994
Constructive codes for arbitrary discrete memoryless channels · IEEE Trans. Inf. Theory 1994
Coding theory › channel coding › error exponent
exponential error bounds
0.011994
Constructive codes for arbitrary discrete memoryless channels · IEEE Trans. Inf. Theory 1994

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

union bound · 0.0random coding exponent · 0.0minimum distance analysis · 0.0concatenated coding · 0.0
YearPublicationVenuePosition
1997 Detection of a spatially distributed target in white noise
abstract
A detector of a spatially distributed target in white Gaussian noise is developed. A reasonable distribution for the a priori target scatterer density is assumed, and a detector that incorporates this a priori knowledge is given. A simple detector form results, whose detection performance is robust over different scattering densities.
Karl Gerlach, Michael J. Steiner, Freeman C. Lin
IEEE Signal Process. Lett.2
1994 The strong simplex conjecture is false
abstract
The design of M average-energy-constrained signals in additive white Gaussian noise is addressed. The long-standing strong simplex conjecture, which postulates that the regular simplex signal set maximizes the probability of correct detection under an average-energy constraint, is disproven. A signal set is presented that performs better than the regular simplex signal set at low signal-to-noise ratios for all M/spl ges/7. This leads to the result that, for all M/spl ges/7, there is no signal set of M signals which is optimal at all signal-to-noise ratios. Furthermore, the optimal signal set at low signal-to-noise ratios is not an equal energy set for any M/spl ges/7. The regular simplex is shown to be the unique signal set which maximizes the minimum distance between signals. It follows that a signal set which maximizes the minimum distance is not necessarily optimum. However, the regular simplex is shown to be globally optimum in the sense of uniquely maximizing the union bound on error probability at all signal-to-noise ratios.>
Michael J. Steiner
IEEE Trans. Inf. Theory1
1994 Constructive codes for arbitrary discrete memoryless channels
abstract
In 1982, Delsarte and Piret constructed a concatenated code for which the error probability decreases exponentially with the block length for a subclass of symmetric channels called regular channels. In the case of arbitrary discrete memoryless channels, they were not able to prove an exponential bound, but one for which the error probability decreases as (log N/N)/sup /spl alpha// where /spl alpha/ is related to the random coding exponent and N is the block length. The present author shows that indeed, the codes also satisfy the much stronger exponential bound for arbitrary discrete memoryless channels and hence are good in this sense. It is also indicated that the codes are valid for the bandlimited additive Gaussian noise channel.>
Michael J. Steiner
IEEE Trans. Inf. Theory1