On pairwise shift-invariant protocol sequences
IEEE Communications Letters
Shift-invariant protocol sequences for the collision channel without feedback
IEEE Transactions on Information Theory
New Protocol Sequences for Random-Access Channels Without Feedback
IEEE Transactions on Information Theory
Constructions for optimal constant weight cyclically permutable codes and difference families
IEEE Transactions on Information Theory
New constructions of optimal cyclically permutable constant weight codes
IEEE Transactions on Information Theory
| Hi-index | 754.84 |
Protocol sequences are used for channel access in the collision channel without feedback. Each user accesses the channel according to a deterministic zero-one pattern, called the protocol sequence. In order to minimize fluctuation of throughput due to delay offsets, we want to construct protocol sequences whose pairwise Hamming cross-correlation is as close to a constant as possible. In this paper, we present a construction of protocol sequences which is based on the bijective mapping between one-dimensional (1-D) sequence and two-dimensional (2-D) arrays by the Chinese Remainder Theorem (CRT). In the application to the collision channel without feedback, a worst-case lower bound on system throughput is derived.