{'fraction_non_alphanumeric': 0.016304347826086956, 'fraction_numerical': 0.0, 'mean_word_length': 5.19327731092437, '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}}
Maximum likelihood decoding bounds for high rate turbo codes over Lorentzian channels

In this paper, we study the problem of turbo coding for magnetic recording channels from a theoretical perspective. In particular we assume that the magnetic recording channel is modeled as a Lorentzian channel, and we develop performance bounds on the bit error probability of turbo codes (parallel or serial) with maximum likelihood decoding. The bound is also applicable to any (uniformly interleaved) binary linear code. This work is an extension of our recent work on performance bounds for partial response channels. The use of the bound is illustrated via some numerical examples, and comparisons based on the simulation results are provided.