Zero-error capacity of binary channels with 1-memory

The zero error capacity of a channel is defined as the least upper bound of rates at which it is possible to transmit information with zero probability of error. Unsolved cases are addressed in this paper to complement the table of the zero error capacity of noisy binary channels with 1-memory. All cases are classified according to the isomorphic property of their confusability graphs, and then we determine the zero error capacity of the rest binary channels with 1-memory one by one.