A General Upper Bound on the Size of Constant-Weight Conflict-Avoiding Codes
From MaRDI portal
Publication:5281394
Abstract: 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 can be supported in the system. In this paper, a new upper bound on the size of conflict-avoiding codes is proved. This upper bound is general in the sense that it is applicable to all code lengths and all Hamming weights. Several existing constructions for conflict-avoiding codes, which are known to be optimal for Hamming weights equal to four and five, are shown to be optimal for all Hamming weights in general.
Cited in
(10)- Partially user-irrepressible sequence sets and conflict-avoiding codes
- Optimal equi-difference conflict-avoiding codes of weight four
- New optimal constructions of conflict-avoiding codes of odd length and weight 3
- Optimal strongly conflict-avoiding codes of even length and weight three
- Classification of optimal conflict-avoiding codes of weights 6 and 7
- Optimal conflict-avoiding codes for three, four and five active users
- Optimal tight equi-difference conflict-avoiding codes of length \(n = 2^{k} \pm 1\) and weight 3
- Optimal conflict-avoiding codes of odd length and weight three
- scientific article; zbMATH DE number 6500353 (Why is no real title available?)
- Weighted maximum matchings and optimal equi-difference conflict-avoiding codes
This page was built for publication: A General Upper Bound on the Size of Constant-Weight Conflict-Avoiding Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281394)
