Metadata only
Date
2013Type
- Conference Paper
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.
Publication status
publishedExternal links
Book title
2013 IEEE International Symposium on Information TheoryPages / Article No.
Publisher
IEEEEvent
Organisational unit
03529 - Lapidoth, Amos / Lapidoth, Amos
More
Show all metadata