We present an upper bound on the zero-error list-coding capacity of discrete memory less channels. Using this bound, we show that the list-3 capacity of the 4/3 channel is at most 03512 b, improving the best previous bound. The relation of the bound to earlier similar bounds, in particular, to Körnevs graph-entropy bound, is discussed. © 1994 IEE
We study the problem of communicating over a discrete memoryless two-way channel using non-adaptive ...
Ahlswede, Cai, and Zhang proved that, in the noise-free limit, the zero-undetected-error capacity is...
We revise the proof of low-rate upper bounds on the reliability function of discrete memoryless chan...
We present a new bound on the zero-error list coding capacity, and using which, show that the list-o...
Cataloged from PDF version of article.We present an upper bound on the zero-error list-coding capac...
Summary form only given. A number of questions recently raised by Elias regarding a zero-error list-...
We begin a systematic study of the problem of the zero-error capacity of noisy binary channels with ...
The zero error decision feedback capacity for discrete memoryless channels is found using a constant...
free limit, the zero-undetected-error capacity is lower bounded by the Sperner capacity of the chann...
Ahlswede R, Cai N, Zhang Z. Erasure, list, and detection zero-error capacities for low noise and a r...
Ahlswede R, Cai N, Zhang Z. Zero-error capacity for models with memory and the enlightened dictator ...
New lower bounds are presented for the minimum error probability that can be achieved through the us...
We revise the proof of low-rate upper bounds on the reliability function of discrete memoryless chan...
We prove a new, improved upper bound on the size of codes C ⊆{1, 2, 3, 4}n with the property that ev...
Shannon in his 1956 seminal paper introduced the concept of the zero error capacity, Co, of a noisy ...
We study the problem of communicating over a discrete memoryless two-way channel using non-adaptive ...
Ahlswede, Cai, and Zhang proved that, in the noise-free limit, the zero-undetected-error capacity is...
We revise the proof of low-rate upper bounds on the reliability function of discrete memoryless chan...
We present a new bound on the zero-error list coding capacity, and using which, show that the list-o...
Cataloged from PDF version of article.We present an upper bound on the zero-error list-coding capac...
Summary form only given. A number of questions recently raised by Elias regarding a zero-error list-...
We begin a systematic study of the problem of the zero-error capacity of noisy binary channels with ...
The zero error decision feedback capacity for discrete memoryless channels is found using a constant...
free limit, the zero-undetected-error capacity is lower bounded by the Sperner capacity of the chann...
Ahlswede R, Cai N, Zhang Z. Erasure, list, and detection zero-error capacities for low noise and a r...
Ahlswede R, Cai N, Zhang Z. Zero-error capacity for models with memory and the enlightened dictator ...
New lower bounds are presented for the minimum error probability that can be achieved through the us...
We revise the proof of low-rate upper bounds on the reliability function of discrete memoryless chan...
We prove a new, improved upper bound on the size of codes C ⊆{1, 2, 3, 4}n with the property that ev...
Shannon in his 1956 seminal paper introduced the concept of the zero error capacity, Co, of a noisy ...
We study the problem of communicating over a discrete memoryless two-way channel using non-adaptive ...
Ahlswede, Cai, and Zhang proved that, in the noise-free limit, the zero-undetected-error capacity is...
We revise the proof of low-rate upper bounds on the reliability function of discrete memoryless chan...
DOI
Add to ORKG