— We develop distributed scheduling schemes that are based on simple random access algorithms and that have no message passing. In spite of their simplicity, these schemes are sh...
Abstract –Given a network targeting information transmission, this paper considers the problem of identifying a set of edges or nodes whose transmission is sufficient to determin...
An achievable rate region for line networks with edge and node capacity constraints and broadcasting is derived. The region is the capacity region if the broadcast channels are ort...
Gerhard Kramer, S. M. Sadegh Tabatabaei Yazdi, Ser...
— Real equiangular tight frames can be especially useful in practice because of their structure. The problem is that very few of them are known. We will look at recent advances o...
—Permutations of order N are generated using polynomials in a Galois field GF(q) where q > N+1, which can be written as a linear transformation on a vector of polynomial coeff...