Abstract—This paper determines the range of feasible values of standard error exponents for binary-input memoryless symmetric channels of fixed capacity C and shows that extremes are attained by the binary symmetric and the binary erasure channel. The proof technique also provides analogous extremes for other quantities related to Gallager’s E0 function, such as the cutoff rate, the Bhattacharyya parameter, and the channel dispersion. I
This paper considers channel coding for the discrete memoryless multiple-access channel with a given...
We begin a systematic study of the problem of the zero-error capacity of noisy binary channels with ...
Abstract — We introduce a thermodynamic (large deviation) formalism for computing error exponents in...
Abstract—This paper determines the range of feasible values of standard error exponents for binary-i...
This paper determines the range of feasible values of standard error exponents for binary-input memo...
We describe certain extremalities for Gallager’s E0 function evaluated under the uniform input distr...
International audienceWe define and study the error exponent of covert communications over binary-in...
International audienceWe define and study the error exponent of covert communications over binary-in...
International audienceWe define and study the error exponent of covert communications over binary-in...
International audienceWe define and study the error exponent of covert communications over binary-in...
International audienceWe define and study the error exponent of covert communications over binary-in...
We derive new upper bounds on the error exponents for the maximum likelihood decoding and error dete...
We study the extremality of the binary erasure channel and the binary symmetric channel for Gallager...
An improved upper bound is given for the maximum attainable exponent of the error probability of max...
An improved upper bound is given for the maximum attainable exponent of the error probability of max...
This paper considers channel coding for the discrete memoryless multiple-access channel with a given...
We begin a systematic study of the problem of the zero-error capacity of noisy binary channels with ...
Abstract — We introduce a thermodynamic (large deviation) formalism for computing error exponents in...
Abstract—This paper determines the range of feasible values of standard error exponents for binary-i...
This paper determines the range of feasible values of standard error exponents for binary-input memo...
We describe certain extremalities for Gallager’s E0 function evaluated under the uniform input distr...
International audienceWe define and study the error exponent of covert communications over binary-in...
International audienceWe define and study the error exponent of covert communications over binary-in...
International audienceWe define and study the error exponent of covert communications over binary-in...
International audienceWe define and study the error exponent of covert communications over binary-in...
International audienceWe define and study the error exponent of covert communications over binary-in...
We derive new upper bounds on the error exponents for the maximum likelihood decoding and error dete...
We study the extremality of the binary erasure channel and the binary symmetric channel for Gallager...
An improved upper bound is given for the maximum attainable exponent of the error probability of max...
An improved upper bound is given for the maximum attainable exponent of the error probability of max...
This paper considers channel coding for the discrete memoryless multiple-access channel with a given...
We begin a systematic study of the problem of the zero-error capacity of noisy binary channels with ...
Abstract — We introduce a thermodynamic (large deviation) formalism for computing error exponents in...