Add to ORKG2 (b) The directed channel graph Fig. 1. The cyclic triangle channel Abstract—We study the zero-undetected-error capacity of the discrete memoryless channel whose directed channel graph is the cyclic triangle. We show that this capacity is upper-bounded by log 2 and approaches log 2 as the crossover probabilities tend to zero. I
AbstractWe apply graph theory to find upper and lower bounds on the channel capacity of a serial, bi...
We present a new bound on the zero-error list coding capacity, and using which, show that the list-o...
Abstract—Recently, Altug and Wagner [1] posed a question regarding the optimal behavior of the proba...
2 (b) The directed channel graph Fig. 1. The cyclic triangle channel Abstract—We study the zero-unde...
free limit, the zero-undetected-error capacity is lower bounded by the Sperner capacity of the chann...
We study the problem of communicating over a discrete memoryless two-way channel using non-adaptive ...
In this correspondence, we study the behavior of the compound channel under a zero-error constraint....
Ahlswede, Cai, and Zhang proved that, in the noise-free limit, the zero-undetected-error capacity is...
Abstract—Ahlswede, Cai, and Zhang proved that, in the noise-free limit, the zero-undetected-error ca...
Cataloged from PDF version of article.We present an upper bound on the zero-error list-coding capac...
Abstruct- For discrete memoryless channels { LV: X + y}, we consider decoders, possibly suboptimal, ...
The zero error decision feedback capacity for discrete memoryless channels is found using a constant...
We begin a systematic study of the problem of the zero-error capacity of noisy binary channels with ...
We present an upper bound on the zero-error list-coding capacity of discrete memory less channels. U...
Abstract — We show that the zero-undetected-error capacity (a.k.a. erasures-only capacity and zero-e...
AbstractWe apply graph theory to find upper and lower bounds on the channel capacity of a serial, bi...
We present a new bound on the zero-error list coding capacity, and using which, show that the list-o...
Abstract—Recently, Altug and Wagner [1] posed a question regarding the optimal behavior of the proba...
2 (b) The directed channel graph Fig. 1. The cyclic triangle channel Abstract—We study the zero-unde...
free limit, the zero-undetected-error capacity is lower bounded by the Sperner capacity of the chann...
We study the problem of communicating over a discrete memoryless two-way channel using non-adaptive ...
In this correspondence, we study the behavior of the compound channel under a zero-error constraint....
Ahlswede, Cai, and Zhang proved that, in the noise-free limit, the zero-undetected-error capacity is...
Abstract—Ahlswede, Cai, and Zhang proved that, in the noise-free limit, the zero-undetected-error ca...
Cataloged from PDF version of article.We present an upper bound on the zero-error list-coding capac...
Abstruct- For discrete memoryless channels { LV: X + y}, we consider decoders, possibly suboptimal, ...
The zero error decision feedback capacity for discrete memoryless channels is found using a constant...
We begin a systematic study of the problem of the zero-error capacity of noisy binary channels with ...
We present an upper bound on the zero-error list-coding capacity of discrete memory less channels. U...
Abstract — We show that the zero-undetected-error capacity (a.k.a. erasures-only capacity and zero-e...
AbstractWe apply graph theory to find upper and lower bounds on the channel capacity of a serial, bi...
We present a new bound on the zero-error list coding capacity, and using which, show that the list-o...
Abstract—Recently, Altug and Wagner [1] posed a question regarding the optimal behavior of the proba...