A conflict-avoiding code (CAC) C of length n and weight k is a collection of k-subsets of Z _ n
such that Δ (x) ∩ Δ (y)= ∅ for any x, y ∈ C, x ≠ y, where Δ (x)={ab:\, a, b ∈ x, a ≠ b\}. Let …

Splitter sets are closely related to lattice tilings, and have applications in flash memories and
conflict-avoiding codes. The study of k-radius sequences was motivated by some problems …

For ak‐subset X of, the set of differences on X is the set (mod n):. A conflict‐avoiding code
CAC of length n and weight k is a collection of k‐subsets of such that=∅ for any distinct. Let …

Conflict-avoiding codes (CACs) have played an important role in multiple-access collision
channel without feedback. The size of a CAC is the number of codewords which equals the …

In this paper, we examine the problem of designing and allocating transmission sequences
to users in a mobile ad hoc network that has no spatial boundary. A basic tenet of the …

Strong external difference families (SEDFs) are much-studied combinatorial objects
motivated by an information security application. A well-known conjecture states that only …

A conflict-avoiding code (CAC) is a deterministic transmission scheme for asynchronous
multiple access without feedback. When the number of simultaneously active users is less …

A conflict-avoiding code (CAC) of length nn and weight ww is defined as a family\mathcal
CC of w w-subsets (called codewords) of Z _n Z n, the ring of residues modulo nn, such that …

We focus on the Age of Information (AoI) performance in a system where each user
generates packets periodically to send to a common access point (AP) for status updating …

Given integers k 1, k 2 with 0≤ k 1< k 2, the determination of all positive integers q for which
there exists a perfect splitter B [− k 1, k 2](q) set is a wide open question in general. In this …