{'fraction_non_alphanumeric': 0.02442159383033419, 'fraction_numerical': 0.0012853470437017994, 'mean_word_length': 4.813432835820896, '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}}
Design of finite-length rate-compatible LDPC codes

This paper considers rate-compatible puncturing for finite-length low-density parity-check (LDPC) codes. Among the existing systematic puncturing methods, the grouping and sorting algorithm (GSA) stands out for its good performance and easy implementation, but as is proven in this paper, there exists a limit on the amount of puncturing that can be done, which restricts the range of the achievable code rates as well as the choice of the mother code. A new puncturing algorithm with better flexibility is developed. The new algorithm can be generally applied to an arbitrary irregular or regular LDPC code to obtain a code rate arbitrarily close to 1, and at the same time to achieve performance that is superior to the GSA.