Computer Science – Information Theory
Scientific paper
2010-06-30
IEEE Trans. on Information Theory, vol. 56, no. 11, p.5780-5795, Nov, 2010
Computer Science
Information Theory
16 pages, 5 figures. Some typos in Section V are corrected
Scientific paper
10.1109/TIT.2010.2070550
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 sequence and two-dimensional array 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.
Shum Kenneth W.
Wong Wing Shing
No associations
LandOfFree
Construction and Applications of CRT Sequences does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Construction and Applications of CRT Sequences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Construction and Applications of CRT Sequences will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-153443