{'fraction_non_alphanumeric': 0.01996007984031936, 'fraction_numerical': 0.0029940119760479044, 'mean_word_length': 5.191358024691358, '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}}
Algorithms for computing network coding rate regions via single element extensions of matroids

We propose algorithms for finding extreme rays of rate regions achievable with vector linear codes over finite fields Fq, q ∈ {2, 3, 4} for which there are known forbidden minors for matroid representability. We use the idea of single element extensions (SEEs) of matroids and enumeration of non-isomorphic matroids using SEEs, to first propose an algorithm to obtain lists of all non-isomorphic matroids representable over a given finite field.We modify this algorithm to produce only the list of all non-isomorphic connected matroids representable over the given finite field. We then integrate the process of testing which matroids in a list of matroids form valid linear network codes for a given network within matroid enumeration. We name this algorithm, which essentially builds all matroids that form valid network codes for a given network from scratch, as network-constrained matroid enumeration.