It is shown that the capacity Cb of a stationary nonanticipatory channel with respect to block coding is at least as great as the capacity Cs of the channel with respect to sliding block coding. For several types of stationary nonanticipatory channels (namely, ergodic channels, channels with additive random noise, and averaged channels whose components are discrete memoryless channels), it is shown that Cb = Cs, thereby generalizing a result of Gray and Ornstein for the discrete memoryless channel
The capacity of channels with block memory is investigated. It is shown that, when the problem is mo...
In this paper, we present a new approach for channel coding on unknown or time-varying channels. Giv...
A “very noisy≓ channel is defined. This definition corresponds to many physical channels operating a...
It is shown that the capacity Cb of a stationary nonanticipatory channel with respect to block codin...
A new definition for the capacity C of a (discrete or semicontinuous) channel with finite memory is ...
Ahlswede R. Channels with arbitrarily varying channel probability functions in the presence of noise...
In this paper, the capacity, C, of the general discrete time-varying channel with memory is derived....
The proof of a coding theorem for abstract memoryless channels is given for a general constraint on ...
A general formula for the capacity of stationary nonanticipatory channels is known. However, it is d...
Fixed and variable-rate block and sliding-block weighted universal noiseless coding theorems are obt...
Ahlswede R, Wolfowitz J. The capacity of a channel with arbitrarily varying channel probability func...
This paper continues the study of algebraic code capacities, which were introduced by Ahlswede (1971...
A proof of the strong converse of the coding theorem for stationary infinite-alphabet channels witho...
We evaluate the information capacity of channels for which the noise process is a Gaussian measure o...
A class of discrete noiseless channels having upper and lower bounds on the separation between adjac...
The capacity of channels with block memory is investigated. It is shown that, when the problem is mo...
In this paper, we present a new approach for channel coding on unknown or time-varying channels. Giv...
A “very noisy≓ channel is defined. This definition corresponds to many physical channels operating a...
It is shown that the capacity Cb of a stationary nonanticipatory channel with respect to block codin...
A new definition for the capacity C of a (discrete or semicontinuous) channel with finite memory is ...
Ahlswede R. Channels with arbitrarily varying channel probability functions in the presence of noise...
In this paper, the capacity, C, of the general discrete time-varying channel with memory is derived....
The proof of a coding theorem for abstract memoryless channels is given for a general constraint on ...
A general formula for the capacity of stationary nonanticipatory channels is known. However, it is d...
Fixed and variable-rate block and sliding-block weighted universal noiseless coding theorems are obt...
Ahlswede R, Wolfowitz J. The capacity of a channel with arbitrarily varying channel probability func...
This paper continues the study of algebraic code capacities, which were introduced by Ahlswede (1971...
A proof of the strong converse of the coding theorem for stationary infinite-alphabet channels witho...
We evaluate the information capacity of channels for which the noise process is a Gaussian measure o...
A class of discrete noiseless channels having upper and lower bounds on the separation between adjac...
The capacity of channels with block memory is investigated. It is shown that, when the problem is mo...
In this paper, we present a new approach for channel coding on unknown or time-varying channels. Giv...
A “very noisy≓ channel is defined. This definition corresponds to many physical channels operating a...