Multichannel Conflict-Avoiding Codes of Weights Three and Four

From MaRDI portal

DOI10.1109/TIT.2020.3025773MaRDI QIDQ5001739zbMATH OpenOpenAlexFDO

Authors Yuan-Hsun Lo, Kenneth W. Shum, Wing Shing Wong, Yi-Jin Zhang

Publication date 23 July 2021

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

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


zbMATH Keywords

Conflict-avoiding codes (CACs)multichannel CACsnumber of codewords for multichannel CACs of weights three and fourupper bounds

Mathematics Subject Classification ID

Source coding (94A29)


Abstract: Conflict-avoiding codes (CACs) were introduced by Levenshtein as a single-channel transmission scheme for a multiple-access collision channel without feedback. When the number of simultaneously active source nodes is less than or equal to the weight of a CAC, it is able to provide a hard guarantee that each active source node transmits at least one packet successfully within a fixed time duration, no matter what the relative time offsets between the source nodes are. In this paper, we extend CACs to multichannel CACs for providing such a hard guarantee over multiple orthogonal channels. Upper bounds on the number of codewords for multichannel CACs of weights three and four are derived, and constructions that are optimal with respect to these bounds are presented.



Recommendations



Cited in
(1)








This page was built for publication: Multichannel Conflict-Avoiding Codes of Weights Three and Four

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Multichannel_Conflict-Avoiding_Codes_of_Weights_Three_and_Four&oldid=92193227"
Powered by MediaWiki