The zero error decision feedback capacity for discrete memoryless channels is found using a constant composition coding argument. Surprisingly, the result is larger for many channels than the known bounds derived earlier by random coding arguments. An upper bound for the retransmission probability is also derived and is hoped to be asymptotically tight for the high rate region. For erasures and error schemes, we show that the bounds in [For68] are not tight and we improve these bounds to obtain new exponential error bounds for such schemes
The input-constrained erasure channel with feedback is considered, where the binary input sequence c...
The input-constrained erasure channel with feedback is considered, where the binary input sequence c...
New lower bounds are presented for the minimum error probability that can be achieved through the us...
Abstract — We show that the zero-undetected-error capacity (a.k.a. erasures-only capacity and zero-e...
An upper bound on the probability of error for discrete memoryless channels with sequential decision...
Abstract — Existing fixed-length feedback communication schemes are either specialized to particular...
M-ary repetition strategies for discrete memoryless channels with feedback are considered. It is sho...
Existing feedback communication schemes are either specialized to particular channels (Schalkwijk–Ka...
The utility of limited feedback for coding over an individual sequence of discrete memoryless channe...
We study the problem of communicating over a discrete memoryless two-way channel using non-adaptive ...
A coding theorem is proved for memoryless channels when the channel state feedback of finite cardina...
Abstract—We study the cutoff rate and the average-listsize capacity of discrete memoryless channels ...
A new analysis technique is suggested for bounding the error probability of fixed length block codes...
An upper bound on the probability of error for discrete memoryless channels with sequential decision...
A coding theorem is proved for memoryless channels when the channel state feedback of finite cardina...
The input-constrained erasure channel with feedback is considered, where the binary input sequence c...
The input-constrained erasure channel with feedback is considered, where the binary input sequence c...
New lower bounds are presented for the minimum error probability that can be achieved through the us...
Abstract — We show that the zero-undetected-error capacity (a.k.a. erasures-only capacity and zero-e...
An upper bound on the probability of error for discrete memoryless channels with sequential decision...
Abstract — Existing fixed-length feedback communication schemes are either specialized to particular...
M-ary repetition strategies for discrete memoryless channels with feedback are considered. It is sho...
Existing feedback communication schemes are either specialized to particular channels (Schalkwijk–Ka...
The utility of limited feedback for coding over an individual sequence of discrete memoryless channe...
We study the problem of communicating over a discrete memoryless two-way channel using non-adaptive ...
A coding theorem is proved for memoryless channels when the channel state feedback of finite cardina...
Abstract—We study the cutoff rate and the average-listsize capacity of discrete memoryless channels ...
A new analysis technique is suggested for bounding the error probability of fixed length block codes...
An upper bound on the probability of error for discrete memoryless channels with sequential decision...
A coding theorem is proved for memoryless channels when the channel state feedback of finite cardina...
The input-constrained erasure channel with feedback is considered, where the binary input sequence c...
The input-constrained erasure channel with feedback is considered, where the binary input sequence c...
New lower bounds are presented for the minimum error probability that can be achieved through the us...