Abstract—Achievable error exponents for the relay channel are derived using the method of types. In particular, two block-Markov coding schemes are analyzed: partial decode-forward and compress-forward. The derivations require combinations of the techniques in the proofs of the packing lemma for the error exponent of channel coding and the covering lemma for the error exponent of source coding with a fidelity criterion. Index Terms—Relay channel, Error exponent, Partial decode-forward, Compress-forward I
Abstract—This paper determines the range of feasible values of standard error exponents for binary-i...
This paper studies expurgated random-coding bounds and exponents for channel coding with a given (po...
This paper studies the random-coding exponent of joint source-channel coding for a scheme where sour...
We compute the random coding error exponent for linear multihop amplify-and-forward (AF) relay chann...
We investigated the error exponent of the wideband relay channel. By computing the random coding err...
Abstract — This paper concerns error exponents and the struc-ture of input distributions maximizing ...
Abstract&¿In this letter we derive the exact random codingerror exponent of a dual hop amplify and f...
This paper studies expurgated random-coding bounds and error exponents for joint source-channel codi...
International audienceWe analyze and compare the maximum-likelihood (ML) decoder and the maximum a-p...
International audienceWe define and study the error exponent of covert communications over binary-in...
A lower bound on the maximum likelihood (ML) decoding error exponent of linear block code ensembles,...
Abstract — In this paper, we study the upper and the lower bounds on the joint source-channel coding...
Abstract — We consider a discrete memoryless relay channel, where both relay and destination may hav...
We investigate the behavior of block errors which arise in data transmission on fading channels. Our...
International audienceWe analyze a class of vector multiple access channels with additive noise, whe...
Abstract—This paper determines the range of feasible values of standard error exponents for binary-i...
This paper studies expurgated random-coding bounds and exponents for channel coding with a given (po...
This paper studies the random-coding exponent of joint source-channel coding for a scheme where sour...
We compute the random coding error exponent for linear multihop amplify-and-forward (AF) relay chann...
We investigated the error exponent of the wideband relay channel. By computing the random coding err...
Abstract — This paper concerns error exponents and the struc-ture of input distributions maximizing ...
Abstract&¿In this letter we derive the exact random codingerror exponent of a dual hop amplify and f...
This paper studies expurgated random-coding bounds and error exponents for joint source-channel codi...
International audienceWe analyze and compare the maximum-likelihood (ML) decoder and the maximum a-p...
International audienceWe define and study the error exponent of covert communications over binary-in...
A lower bound on the maximum likelihood (ML) decoding error exponent of linear block code ensembles,...
Abstract — In this paper, we study the upper and the lower bounds on the joint source-channel coding...
Abstract — We consider a discrete memoryless relay channel, where both relay and destination may hav...
We investigate the behavior of block errors which arise in data transmission on fading channels. Our...
International audienceWe analyze a class of vector multiple access channels with additive noise, whe...
Abstract—This paper determines the range of feasible values of standard error exponents for binary-i...
This paper studies expurgated random-coding bounds and exponents for channel coding with a given (po...
This paper studies the random-coding exponent of joint source-channel coding for a scheme where sour...