: The classical result in the theory of random graphs, proved by Erd˝os and Rényi in 1960, concerns the threshold for the appearance of the giant component in the random graph pr...
Tom Bohman, Alan M. Frieze, Michael Krivelevich, P...
—An improved concatenated code structure, which generalizes parallel and serially concatenated convolutional codes is presented and investigated. The structure is ideal for desig...
Alexandre Graell i Amat, Lars K. Rasmussen, Fredri...
In this paper we propose a block-by-block iterative receiver for underwater MIMO-OFDM that couples channel estimation with MIMO detection and channel decoding. In particular, the c...
Jie Huang, Jianzhong Huang, Christian R. Berger, S...
: We study the interplay of network connectivity and the issues related to the `possibility', `feasibility' and `optimality' for unconditionally reliable message tra...
Arpita Patra, Ashish Choudhury, C. Pandu Rangan, K...
We present an experimental investigation of tabu search (TS) to solve the 3-coloring problem (3-COL). Computational results reveal that a basic TS algorithm is able to find proper ...