The proof of a coding theorem for abstract memoryless channels is given for a general constraint on codewords. Except for a few basic measure-theoretic facts the proof uses only known results for the discrete memoryless channel
In this article, we revisit the classical problem of channel coding and obtain novel results on prop...
Random coding theorems are proved for discrete memoryless arbitrarily varying channels (AVCs) with c...
New lower bounds are presented for the minimum error probability that can be achieved through the us...
The proof of a coding theorem for abstract memoryless channels is given for a general constraint on ...
This paper continues the study of algebraic code capacities, which were introduced by Ahlswede (1971...
SummaryIt was proved by Ahlswede (1971) that codes whose codewords form a group or even a linear spa...
It is shown that the capacity Cb of a stationary nonanticipatory channel with respect to block codin...
Ahlswede R. Channels with arbitrarily varying channel probability functions in the presence of noise...
A new definition for the capacity C of a (discrete or semicontinuous) channel with finite memory is ...
Given any pair of arbitrary alphabet channels satisfying coding theorem and its strong converse. The...
In this paper, the capacity, C, of the general discrete time-varying channel with memory is derived....
A proof of the strong converse of the coding theorem for stationary infinite-alphabet channels witho...
Ahlswede R, Gemma J. Bounds on algebraic code capacities for noisy channels. I. Information and Cont...
Ahlswede R, Gemma J. Bounds on algebraic code capacities for noisy channels. II. Information and Con...
A class of discrete noiseless channels having upper and lower bounds on the separation between adjac...
In this article, we revisit the classical problem of channel coding and obtain novel results on prop...
Random coding theorems are proved for discrete memoryless arbitrarily varying channels (AVCs) with c...
New lower bounds are presented for the minimum error probability that can be achieved through the us...
The proof of a coding theorem for abstract memoryless channels is given for a general constraint on ...
This paper continues the study of algebraic code capacities, which were introduced by Ahlswede (1971...
SummaryIt was proved by Ahlswede (1971) that codes whose codewords form a group or even a linear spa...
It is shown that the capacity Cb of a stationary nonanticipatory channel with respect to block codin...
Ahlswede R. Channels with arbitrarily varying channel probability functions in the presence of noise...
A new definition for the capacity C of a (discrete or semicontinuous) channel with finite memory is ...
Given any pair of arbitrary alphabet channels satisfying coding theorem and its strong converse. The...
In this paper, the capacity, C, of the general discrete time-varying channel with memory is derived....
A proof of the strong converse of the coding theorem for stationary infinite-alphabet channels witho...
Ahlswede R, Gemma J. Bounds on algebraic code capacities for noisy channels. I. Information and Cont...
Ahlswede R, Gemma J. Bounds on algebraic code capacities for noisy channels. II. Information and Con...
A class of discrete noiseless channels having upper and lower bounds on the separation between adjac...
In this article, we revisit the classical problem of channel coding and obtain novel results on prop...
Random coding theorems are proved for discrete memoryless arbitrarily varying channels (AVCs) with c...
New lower bounds are presented for the minimum error probability that can be achieved through the us...
DOI
Add to ORKG