New improved upper and lower bounds on the maximum size of a symmetric or arbitrary
conflict-avoiding code of length n= 4 m for three active users are proved. Furthermore, direct …

A conflict-avoiding code of length n and weight k is defined as a set C ⊆ {0, 1\}^ n of binary
vectors, called codewords, all of Hamming weight k such that the distance of arbitrary cyclic …

Conflict-avoiding codes are used in the multiple-access collision channel without feedback.
The number of codewords in a conflict-avoiding code is the number of potential users that …

Direct constructions for optimal conflict-avoiding codes of length n≡48 and weight 3 are
provided by bringing in a new concept called an extended odd sequence. Constructions for …

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)= ∅ holds for any x, y ∈ C, x\not= y, where Δ (x)={ji\,|\, i, j ∈ x, i\not= j\} …

Optical orthogonal codes are commonly used as signature codes for optical code-division
multiple access systems. So far, research on 2-D optical orthogonal codes has mainly …

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 …

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 …

A conflict-avoiding code (CAC) is known as a protocol sequence for transmitting data
packets over a collision channel without feedback. The study of CACs has been focused on …

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 …