The signature coding for M active users out of T total users over a multiple access OR channel is considered. The mathematical problem is equivalent to the M-cover-free problem of extremal set theory. We survey the upper and lower bounds on the minimal code word length n(T, M), and present some code constructions. According to the current state of the… (More)
Detailed knowledge about the traffic mixture is essential for network operators and administrators, as it is a key input for numerous network management activities. Several traffic classification approaches co-exist in the literature, but none of them performs well for all different application traffic types present in the Internet. In this study we compare… (More)
— Signature coding for multiple access OR channel is considered. We prove that in block asynchronous case the upper bound on the minimum code length asymptotically is the same as in the case of synchronous access.