{'fraction_non_alphanumeric': 0.017482517482517484, 'fraction_numerical': 0.0, 'mean_word_length': 5.006993006993007, '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}}
An algorithm for the estimation of the minimum distance of LDPC codes

The evaluation of the minimum distance of low-density parity-check (LDPC) codes remains an open problem due to the rather large dimension of the parity check matrix H associated with any practical code. In this article, we propose an effective modification of the error impulse (EI) technique for estimation of the minimum distance of the LDPCs. The EI method is successfully applied to suboptimum decoding algorithms such as the iterative MAP decoding algorithm for turbo codes. We present novel modifications and extensions of this method to the suboptimum iterative sum-product algorithm for LDPCs. Simulation results validate the functionality of the proposed technique. Simulations focus on a particular class of LDPC codes, but our approach is general and applies to any LDPC code.