6,762 research outputs found
Construction and Applications of CRT Sequences
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.Comment: 16 pages, 5 figures. Some typos in Section V are correcte
A cut-invariant law of large numbers for random heaps
Heap monoids equipped with Bernoulli measures are a model of probabilistic
asynchronous systems. We introduce in this framework the notion of asynchronous
stopping time, which is analogous to the notion of stopping time for classical
probabilistic processes. A Strong Bernoulli property is proved. A notion of
cut-invariance is formulated for convergent ergodic means. Then a version of
the Strong law of large numbers is proved for heap monoids with Bernoulli
measures. Finally, we study a sub-additive version of the Law of large numbers
in this framework based on Kingman sub-additive Ergodic Theorem.Comment: 29 pages, 3 figures, 21 reference
- …