{'fraction_non_alphanumeric': 0.04044117647058824, 'fraction_numerical': 0.0, 'mean_word_length': 4.797872340425532, '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}}
On Decoding Random-Access SC-LDPC Codes

We study a new decoding strategy of multi-block SC-LDPC codes motivated by data-storage applications. To decode a sub-block out of the full code block, our proposed decoder accesses a small number of sub-blocks around the desired sub-block. We call this decoding strategy "semi-global decoding", and parametrize it by its access cost: the number of accessed sub-blocks. We provide a theoretical characterization of decoding performance, and evaluate this performance for random-access SC-LDPC ensembles.