— Interleave division multiple access (IDMA) recently attracted many research activities because of its excellent performance despite its reasonable low complexity. The low compl...
Katsutoshi Kusume, Guido Dietl, Wolfgang Utschick,...
We present a very efficient multi-party computation protocol unconditionally secure against an active adversary. The security is maximal, i.e., active corruption of up to t < n/...
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
The aim of this paper is to provide an analysis of the function of imperatives in dialogue. In particular, the focus is on the use of logically complex imperatives (e.g., `Say hel...
Existing high-rate full diversity space-time codes (STC) always have high decoding complexity with traditional ML (maximum-likelihood) or near-ML decoding. Hence the decoding schem...
Tian Peng Ren, Yong Liang Guan, Chau Yuen, Er Yang...