{'fraction_non_alphanumeric': 0.011523687580025609, 'fraction_numerical': 0.0, 'mean_word_length': 5.015384615384615, '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}}
Coding Theorems on the Simple Capacity for Digital Fingerprinting Codes

Digital fingerprinting codes provide a method to protect licensed digital contents against illegal redistribution. We focus on the situation where two malicious users collude and generate an overwritten codeword by using a memoryless collusion channel. We investigate coding theorems for the digital fingerprinting codes using a simple decoder such that each user is judged as malicious or innocent from an overwritten codeword together with his/her codeword. We first discuss the case where the collusion channel is known. We give a formula of the simple capacity. Next, we consider the case where the collusion channel is unknown. We succeed in giving the formula of a simple capacity of this case as well.