{'fraction_non_alphanumeric': 0.01877133105802048, 'fraction_numerical': 0.0017064846416382253, 'mean_word_length': 5.2727272727272725, '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}}
Large Families of Asymptotically Optimal Two-Dimensional Optical Orthogonal Codes

Nine new two-dimensional Optical Orthogonal Codes (2-D OOCs) are presented here, all sharing the common feature of a code size that is much larger in relation to the number of time slots than those of constructions appearing previously in the literature. Each of these constructions is either optimal or asymptotically optimal with respect to either the original Johnson bound or else a nonbinary version of the Johnson bound introduced in this paper. The first five codes are constructed using polynomials over finite fields-the first construction is optimal while the remaining four are asymptotically optimal. The next two codes are constructed using rational functions in place of polynomials and these are asymptotically optimal. The last two codes, also asymptotically optimal, are constructed by composing two of the above codes with a constant weight binary code. Also presented is a three-dimensional Optical Orthogonal Code (3-D OOC) that exploits the polarization dimension. Finally, phase-encoded optical CDMA is considered and construction of two efficient codes are provided.