Optimal strongly conflict-avoiding codes of even length and weight three

DOI10.1007/S10623-015-0057-7zbMATH Open1405.94132arXiv1406.6210OpenAlexW3098047458MaRDI QIDQ285257FDOQ285257

Authors: Yi-Jin Zhang, Yuan-Hsun Lo, Wing Shing Wong

Publication date: 19 May 2016

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Abstract: Strongly conflict-avoiding codes (SCACs) are employed in a 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. Assume all users are assigned distinct codewords, the number of codewords in an SCAC is equal to the number of potential users that can be supported. SCACs have different combinatorial structure compared with conflict-avoiding codes (CACs) due to additional collisions incurred by partially overlapped transmissions. In this paper, we establish upper bounds on the size of SCACs of even length and weight three. Furthermore, it is shown that some optimal CACs can be used to construct optimal SCACs of weight three.

Full work available at URL: https://arxiv.org/abs/1406.6210

Recommendations

zbMATH Keywords

conflict-avoiding code protocol sequence strongly conflict-avoiding code

Mathematics Subject Classification ID

Combinatorial codes (94B25) Applications of design theory to circuits and networks (94C30)

Cites Work

Cited In (6)

This page was built for publication: Optimal strongly conflict-avoiding codes of even length and weight three

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q285257)