Abstract — This paper concerns error exponents and the struc-ture of input distributions maximizing the random coding expo-nent for a stochastic channel model. The following conclusions are obtained under general assumptions on the channel statistics: (i) The optimal distribution has a finite number of mass points, or in the case of a complex channel, the amplitude has finite support. (ii) A new class of algorithms is introduced based on the cutting-plane method to construct an optimal input dis-tribution. The algorithm constructs a sequence of discrete distributions, along with upper and lower bounds on the random coding exponent at each iteration. (iii) In some numerical example considered, the resulting code significantly out-performs tr...
This paper studies the random-coding exponent of joint source-channel coding for a scheme where sour...
We derive a random-coding upper bound on the average probability of error of joint source-channel co...
Abstract — We present theoretical and numerical evidence showing that optimal channel codes are typi...
This paper concerns the structure of optimal codes for stochastic channel models. An investigation o...
Capacity formulas and random-coding exponents are derived for a generalized family of Gel’fand-Pinsk...
This paper concerns the structure of optimal codes for stochastic channel models. An investigation o...
This paper studies expurgated random-coding bounds and exponents for channel coding with a given (po...
This paper studies expurgated random-coding bounds and exponents for channel coding with a given (po...
Abstract- The minimum probability of error achievable by random codes on the arbitrarily varying cha...
This paper studies expurgated random-coding bounds and exponents for channel coding with a given (po...
This paper presents a random-coding upper bound on the average error probability of joint source-cha...
Abstract — This paper studies expurgated random-coding bounds and exponents for channel coding with ...
This paper studies the random-coding exponent of joint source-channel coding for a scheme where sour...
We introduce a random code construction for channel coding in which the codewords are constrained to...
Abstract — This paper studies the random-coding exponent of joint source-channel coding for a scheme...
This paper studies the random-coding exponent of joint source-channel coding for a scheme where sour...
We derive a random-coding upper bound on the average probability of error of joint source-channel co...
Abstract — We present theoretical and numerical evidence showing that optimal channel codes are typi...
This paper concerns the structure of optimal codes for stochastic channel models. An investigation o...
Capacity formulas and random-coding exponents are derived for a generalized family of Gel’fand-Pinsk...
This paper concerns the structure of optimal codes for stochastic channel models. An investigation o...
This paper studies expurgated random-coding bounds and exponents for channel coding with a given (po...
This paper studies expurgated random-coding bounds and exponents for channel coding with a given (po...
Abstract- The minimum probability of error achievable by random codes on the arbitrarily varying cha...
This paper studies expurgated random-coding bounds and exponents for channel coding with a given (po...
This paper presents a random-coding upper bound on the average error probability of joint source-cha...
Abstract — This paper studies expurgated random-coding bounds and exponents for channel coding with ...
This paper studies the random-coding exponent of joint source-channel coding for a scheme where sour...
We introduce a random code construction for channel coding in which the codewords are constrained to...
Abstract — This paper studies the random-coding exponent of joint source-channel coding for a scheme...
This paper studies the random-coding exponent of joint source-channel coding for a scheme where sour...
We derive a random-coding upper bound on the average probability of error of joint source-channel co...
Abstract — We present theoretical and numerical evidence showing that optimal channel codes are typi...