Abstract
Strongly conflict-avoiding codes are used in the asynchronous multiple-access collision channel without feedback. The number of codewords in a strongly conflict-avoiding code is the number of potential users that can be supported in the system. In this paper, an improved upper bound on the size of strongly conflict-avoiding codes of length $$n$$n and weight three is obtained. This bound is further shown to be tight for some cases by direct constructions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.