Abstract
Strongly conflict-avoiding codes (SCACs) are used in the slot-asynchronous multiple-access collision channel without feedback to guarantee that each active user can send at least one packet successfully in the worst case within a fixed period of time. The number of codewords in an SCAC is the number of potential users that can be supported. In this paper, a general upper bound on the size of SCAC is derived. We further improve the upper bound if the code has some special structure, called equi-difference, and we show this bound is asymptotically tight.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
