Correction to "The Generalized Stochastic Likelihood Decoder: Random Coding and Expurgated Bounds"

نویسنده

  • Neri Merhav
چکیده

In a recent article [1], random coding error exponents and expurgated exponents were analyzed for the generalized likelihood decoder (GLD), where the decoded message is randomly selected under a probability distribution that is proportional to a general exponential function of the empirical joint distribution of the codeword and the channel output vectors. In Section V of [1], Theorem 2 provides an expurgated exponent which is applicable to this decoder (and hence also to the optimal maximum likelihood decoder). The proof of that theorem is based on two steps of a certain expurgation procedure. Nir Weinberger has brought to my attention that there is a certain gap in that proof, as the second expurgation step might interfere with the first step (more details will follow in Section 2 of this letter). The purpose of this letter is to provide an alternative proof to the above mentioned theorem.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

IRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES The Generalized Stochastic Likelihood Decoder: Random Coding and Expurgated Bounds

The likelihood decoder is a stochastic decoder that selects the decoded message at random, using the posterior distribution of the true underlying message given the channel output. In this work, we study a generalized version of this decoder where the posterior is proportional to a general function that depends only on the joint empirical distribution of the output vector and the codeword. This...

متن کامل

Expurgated Bounds for the Asymmetric Broadcast Channel

This work contains two main contributions concerning the expurgation of hierarchical ensembles for the asymmetric broadcast channel. The first is an analysis of the optimal maximum likelihood (ML) decoders for the weak and strong user. Two different methods of code expurgation will be used, that will provide two competing error exponents. The second is the derivation of expurgated exponents und...

متن کامل

IRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES List Decoding − Random Coding Exponents and Expurgated Exponents

Some new results are derived concerning random coding error exponents and expurgated exponents for list decoding with a deterministic list size L. Two asymptotic regimes are considered, the fixed list–size regime, where L is fixed independently of the block length n, and the exponential list–size, where L grows exponentially with n. We first derive a general upper bound on the list–decoding ave...

متن کامل

Error exponents of typical random codes

We define the error exponent of the typical random code as the long–block limit of the negative normalized expectation of the logarithm of the error probability of the random code, as opposed to the traditional random coding error exponent, which is the limit of the negative normalized logarithm of the expectation of the error probability. For the ensemble of uniformly randomly drawn fixed comp...

متن کامل

On Bounds for $E$-capacity of DMC

–Random coding, expurgated and sphere packing bounds are derived by method of types and method of graph decomposition for E-capacity of discrete memoryless channel (DMC). Three decoding rules are considered, the random coding bound is attainable by each of the three rules, but the expurgated bound is achievable only by maximum-likelihood decoding. Sphere packing bound is obtained by very simple...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 63  شماره 

صفحات  -

تاریخ انتشار 2017