On pairwise shift-invariant protocol sequences

Authors:
Yijin Zhang;Kenneth W. Shum;Wing Shing Wong
Affiliations:
Dept. of Information Engineering, The Chinese University of Hong Kong, Shatin, Hong Kong;Dept. of Information Engineering, The Chinese University of Hong Kong, Shatin, Hong Kong;Dept. of Information Engineering, The Chinese University of Hong Kong, Shatin, Hong Kong
Venue:
IEEE Communications Letters
Year:
2009

Citing 2
Cited 1

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

Construction and applications of CRT sequences

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.06

Visualization

Abstract

Protocol sequences offer an approach to implement random-access channel without feedback. For these sequences, it is desirable that their cross-correlation should be as low as possible and that the length of their period should not be short. Completely shift-invariant sequences form an important class of protocol sequences which have perfect cross-correlation property but exponential growth period as a function of the number of users. We investigate in this paper a broader class of protocol sequences which are only pairwise shift-invariant. Results on minimum period and bit-pattern structure are presented.