{'fraction_non_alphanumeric': 0.02121433796634967, 'fraction_numerical': 0.001463057790782736, 'mean_word_length': 5.0, 'pattern_counts': {'":': 0, '<': 1, '<?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}}
Protocol Sequences for the Multiple-Packet Reception Channel Without Feedback

Consider a time-slotted communication channel that is shared by K active users transmitting to a single receiver. It is assumed that the receiver has the ability of the multiple-packet reception to correctly receive up to γ (1 ≤ γ <; K) simultaneously transmitted packets. Each user accesses the channel following a deterministic binary sequence, called the protocol sequence, and transmits a packet within a channel slot if the sequence value is equal to one. If the users are not time synchronized, the relative shifts among them can cause significant fluctuation in throughput. If the throughput of each user is independent of relative shifts, then the adopted protocol sequence set is said to be throughput-invariant (TI). If we define worst-case system throughput as the minimal system throughput that can be guaranteed for any set of relative shifts, then TI sequences maximize it and hence are of fundamental interest. This paper investigates TI sequences for γ ≥ 1. Several new results are obtained including throughput value as a function of the duty factors, a lower bound on the sequence period, a construction that achieves the lower bound on the sequence period, and theorems on the intrinsic structure that establish connections with some other families of binary sequences.