Optimal MC-CACs are derived for M < w via exceptional codewords and additive combinatorics, generalizing earlier CAC constructions and extending to AM-OPPTS and mixed-weight variants.
A new upper bound and optimal constructions of equi-difference conflict-avoiding codes on constant weight,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Multichannel Conflict-Avoiding Codes for Expanded Scenarios
Optimal MC-CACs are derived for M < w via exceptional codewords and additive combinatorics, generalizing earlier CAC constructions and extending to AM-OPPTS and mixed-weight variants.