Sipser and Spielman have introduced a constructive family of asymptotically good linear error-correcting codes--expander codes--together with a simple parallel algorithm that will ...
Abstract. The depth of a planar embedding is a measure of the topological nesting of the biconnected components of the graph. Minimizing the depth of planar embeddings has importan...
We study a many-to-many generalisation of the well-known stable roommates problem in which each participant seeks to be matched with a number of others. We present a linear-time a...
It is shown that the queuing delay involved in the congestion control algorithm is state-dependent and does not depend on the current time. Then, using an accurate formulation for ...
—This paper describes a new blind channel estimation algorithm for Space-Time Block Coded (STBC) systems. The proposed method exploits the statistical independence of sources bef...
Vincent Choqueuse, Ali Mansour, Gilles Burel, Ludo...