On Zero-Error Capacity of Binary Channels With One Memory

The zero-error capacity of a channel is defined as the maximum rate at which it is possible to transmit information with zero probability of error. In this paper, we settle all previously unsolved cases for the zero-error capacity of binary channels with one memory.

[1]  Claude E. Shannon,et al.  The zero error capacity of a noisy channel , 1956, IRE Trans. Inf. Theory.

[2]  Haim H. Permuter,et al.  Zero-Error Feedback Capacity of Channels With State Information Via Dynamic Programming , 2010, IEEE Transactions on Information Theory.

[3]  Tadashi Wadayama,et al.  On zero error capacity of Nearest Neighbor Error channels with multilevel alphabet , 2016, 2016 International Symposium on Information Theory and Its Applications (ISITA).

[4]  Rudolf Ahlswede,et al.  Zero-Error Capacity for Models with Memory and the Enlightened Dictator Channel , 1998, IEEE Trans. Inf. Theory.

[5]  Gérard D. Cohen,et al.  Zero-Error Capacity of Binary Channels With Memory , 2016, IEEE Transactions on Information Theory.

[6]  Ning Cai,et al.  Zero-error capacity of binary channels with 1-memory , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[7]  Petar Popovski,et al.  Zero-Error Capacity of a Class of Timing Channels , 2014, IEEE Transactions on Information Theory.

[8]  Imre Csiszár,et al.  Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .

[9]  M. Fekete.  Über die Verteilung der Wurzeln bei gewissen algebraischen Gleichungen mit ganzzahligen Koeffizienten , 1918 .

[10]  László Lovász,et al.  On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.