|| New Results on Optimal Multichannel Conflict-Avoiding Codes
||Yuan-Hsun Lo, Wen-Wen Gu, National Pingtung University, Taiwan; Yijin Zhang, Nanjing University of Science and Technology, China|
||D7-S3-T1: Topics in Multiple Access II
||Tuesday, 20 July, 22:40 - 23:00
||Tuesday, 20 July, 23:00 - 23:20
A multichannel conflict-avoiding code of length L and weight w with M channels, denoted by MCCAC(M,L,w), is used for multiple-access in a collision channel without feedback. When the number of simultaneously active users is less than or equal to w, an MCCAC(M,L,w) is able to provide a hard guarantee that each active user has a successful transmission within every consecutive L time slots. An upper bound on the number of potential users, or codewords, that an MCCAC(2,L,3) can support is derived in this paper. By means of (hooked) Skolem sequences, we propose a new construction that can provide a series of optimal MCCAC(2,L,3)s in the sense that the code sizes achieve the obtained upper bounds.