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

Andrew L. McKellips

dblp:78/5459 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 2004
—ORCID · none

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

Theory of computation · 2 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 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
3 papers
Information theory · 55% Coding theory · 45%
Network and information security
1 paper
Digital forensics and information hiding · 100%

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

TopicWeightPapersLastEvidence papers
Information theory › communication channels › channel models
binary-input channel
0.021998
Maximin Performance of Binary-Input Channels with Uncertain Noise Distributions · IEEE Trans. Inf. Theory 1998
Worst case additive noise for binary-input channels and zero-threshold detection under constraints of power and divergence · IEEE Trans. Inf. Theory 1997
Coding theory
channel coding
0.021998
Maximin Performance of Binary-Input Channels with Uncertain Noise Distributions · IEEE Trans. Inf. Theory 1998
Worst case additive noise for binary-input channels and zero-threshold detection under constraints of power and divergence · IEEE Trans. Inf. Theory 1997
Digital forensics and information hiding
watermarking
0.011999
Watermarking as communications with side information · Proc. IEEE 1999
Information theory › communication channels › channel models › noisy channel
worst-case noise
0.011997
Worst case additive noise for binary-input channels and zero-threshold detection under constraints of power and divergence · IEEE Trans. Inf. Theory 1997
Coding theory › source coding
side information
0.011999
Watermarking as communications with side information · Proc. IEEE 1999

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

information-theoretic analysis · 0.0divergence constraint · 0.0asymptotic analysis · 0.0spread-spectrum communications · 0.0spread spectrum communication · 0.0
YearPublicationVenuePosition
2004 Simple tight bounds on capacity for the peak-limited discrete-time channel
abstract
We introduce simple tight upper and lower bounds on capacity for the peak-limited discrete-time additive Gaussian noise channel with a significant reduction in computational burden over existing methods. These bounds provide an envelope of uncertainty sufficiently tight to be employed as effective approximations
Andrew L. McKellips
ISIT1
1999 Watermarking as communications with side information
abstract
Several authors have drawn comparison between embedded signaling or watermarking and communications, especially spread-spectrum communications. We examine the similarities and differences between watermarking and traditional communications. This comparison suggests that watermarking most closely resembles communications with side information at the transmitter and or detector, a configuration originally described by Shannon (1958). This leads to several novel characteristics and insights regarding embedded signaling which are discussed in detail.
Ingemar J. Cox, Matthew L. Miller, Andrew L. McKellips
Proc. IEEE3
1998 Maximin Performance of Binary-Input Channels with Uncertain Noise Distributions
abstract
We consider uncertainty classes of noise distributions defined by a bound on the divergence with respect to a nominal noise distribution. The noise that maximizes the minimum error probability for binary-input channels is found. The effect of the reduction in uncertainty brought about by knowledge of the signal-to-noise ratio is also studied. The particular class of Gaussian nominal distributions provides an analysis tool for near-Gaussian channels. The asymptotic behavior of the least favorable noise distribution and the resulting error probability are studied in a variety of scenarios, namely: asymptotically small divergence with and without power constraint; asymptotically large divergence with and without power constraint; and asymptotically large signal-to-noise ratio.
Andrew L. McKellips, Sergio Verdú
IEEE Trans. Inf. Theory1
1997 Worst case additive noise for binary-input channels and zero-threshold detection under constraints of power and divergence
abstract
Additive-noise channels with binary inputs and zero-threshold detection are considered. We study worst case noise under the criterion of maximum error probability with constraints on both power and divergence with respect to a given symmetric nominal noise distribution. Particular attention is focused on the cases of a) Gaussian nominal distributions and b) asymptotic increase in worst case error probability when the divergence tolerance tends to zero.
Andrew L. McKellips, Sergio Verdú
IEEE Trans. Inf. Theory1