{'fraction_non_alphanumeric': 0.04363001745200698, 'fraction_numerical': 0.02268760907504363, 'mean_word_length': 4.627450980392157, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Capacity of the Ising channel with feedback

In this paper we consider the Ising channel, which is a channel with memory. We formulate a dynamic program that characterizes the capacity of the Ising channel with feedback and solve it numerically using the value iteration algorithm. We then establish analytically that the feedback capacity is the expression C = (2H(a) over 3+a) ≈ 0.575522 where a is a particular root of a fourth-degree polynomial and, simultaneously, is the value that maximizes (2H(z) over 3+z) over 0 ≤ z ≤ 1, where H(z) is the binary entropy function.