Zero-error capacity of binary channels with memory

2014/02/03 by Gérard Cohen, Cohen, Gérard, Emanuela Fachini +3
Computer Science · Mathematics · #05D05 #94A24 #Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #cs.IT #math.CO #math.IT #msc:05D05 #msc:94A24

paper · pdf · doi:10.48550/arxiv.1402.0349

10 pages. This paper is the revised version of our previous paper having the same title, published on ArXiV on February 3, 2014. We complete Theorem 2 of the previous version by showing here that our previous construction is asymptotically optimal. This proves that the isometric triangles yield different capacities. The new manuscript differs from the old one by the addition of one more page

arxiv created 2015/04/14 · arxiv updated 2016/02/22

Abstract

We begin a systematic study of the problem of the zero--error capacity of noisy binary channels with memory and solve some of the non--trivial cases.

Related

• Computability of the Zero-Error Capacity of Noisy Channels
• Generalized Bounds on the Capacity of the Binary-Input Channels
• A VC-dimension-based Outer Bound on the Zero-Error Capacity of the Binary Adder Channel
• The adaptive zero-error capacity for a class of channels with noisy feedback
• On the Zero-Error Capacity of Semantic Channels with Input and Output Memories