Asymptotic multichannel conflict-avoiding code conjecture

Let $M$ and $w$ be positive integers with $w\geq M$, and let $K(M,L,w)$ denote the maximum number of codewords in an $M$-channel conflict-avoiding code of length $L$ and weight $w$. Asymptotic multichannel CAC conjecture. For all $w\geq M$, one has

$$\limsup_{L\to\infty} \frac{K(M,L,w)}{L} = \frac{M(M-1)}{(2w-M)(w-1)} + \frac{M}{2w-2}.$$

This conjecture is motivated by the known single-channel asymptotic result and the asymptotic lower bound obtained for general multichannel conflict-avoiding codes. It remains an open problem for future investigation.