{'fraction_non_alphanumeric': 0.017902813299232736, 'fraction_numerical': 0.0, 'mean_word_length': 4.850746268656716, '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}}
Construction of wiretap channel codes by using sparse matrices

The aim of this paper is to construct wiretap channel codes based on the the notion of a hash property for an ensemble of functions (sparse matrices). The theorem implies that codes using sparse matrices can achieve the optimal rate. Furthermore, the fixed-rate universal coding theorem for a wiretap channel is also presented.