Shannon's channel coding theorem characterizes the maximal rate of information that can
be reliably transmitted over a communication channel when optimal encoding and decoding …

This paper considers the problem of channel coding with a given (possibly suboptimal)
maximum-metric decoding rule. A cost-constrained random-coding ensemble with multiple …

The problem of characterizing achievable rates and error exponents for discrete memoryless
channels with mismatched decoding is addressed. A mismatched cognitive multiple-access …

We derive a single-letter upper bound to the mismatched-decoding capacity for discrete
memoryless channels. The bound is expressed as the mutual information of a transformation …

This monograph offers a toolbox of mathematical techniques that have been effective and
widely applicable in informationtheoretic analyses. The first tool is a generalization of the …

We derive a sphere-packing error exponent for coded transmission over discrete
memoryless channels with a fixed decoding metric. By studying the error probability of the …

We develop a novel framework for proving converse theorems for channel coding, which is
based on the analysis technique of multicast transmission with an additional auxiliary …

Abstract Information-theoretic studies of channel coding typically seek to characterize the
performance of coded communication systems when the encoder and decoder can be …

We introduce a new analysis technique that we use to derive a single-letter upper bound on
the mismatch capacity of a stationary point-to-point memoryless channel with decoding …

We revisit the multicasting approach to the analysis of converse bounds that we recently
introduced, and present a refined proof technique for upper bounding the mismatch capacity …