{'fraction_non_alphanumeric': 0.018005540166204988, 'fraction_numerical': 0.0, 'mean_word_length': 5.07563025210084, '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 Optimal Minimax Jamming and Detection of Radar Signals

A game between an intelligent jammer J and decision maker DM is considered. DM seeks to detect a coherent slowly fading narrowband signal under a Neyman-Pearson criterion. His observations are corrupted with additive narrowband noise, the source of which is J's jamming with a power constraint, but otherwise almost arbitrary statistics. DM knows J's action but the converse is not true. When the number of samples increases asymptotically, a minimax solution for the game exists where the jamming is Gaussian, independent of the desired signal amplitude level and probability distribution. The same result also holds for detection of a nonrandom baseband signal.