—A network of n communication links, operating over a shared wireless channel, is considered. Fading is assumed to be the dominant factor affecting the strength of the channels b...
Masoud Ebrahimi, Mohammad Ali Maddah-Ali, Amir K. ...
Abstract— This paper develops and compares two asynchronous distributed scheduling algorithms for multiple controlled searchlights in nonconvex polygonal environments. A searchli...
Karl J. Obermeyer, Anurag Ganguli, Francesco Bullo
— We address the problem of the algebraic decoding of any cyclic code up to the true minimum distance. For this, we use the classical formulation of the problem, which is to fin...
Daniel Augot, Magali Bardet, Jean-Charles Faug&egr...
— Finding low-weight multiples of a binary polynomial is a difficult problem arising in the context of stream ciphers cryptanalysis. The best algorithms to solve this problem ar...
— Design criteria and full-diversity Distributed Space Time Codes (DSTCs) for the two phase transmission based cooperative diversity protocol of Jing-Hassibi and the Generalized ...
— A construction of a new family of distributed space time codes (DSTCs) having full diversity and low Maximum Likelihood (ML) decoding complexity is provided for the two phase b...
— In this paper we concentrate on rate-1/3 systematic parallel concatenated convolutional codes and their rate-1/2 punctured child codes. Assuming maximum-likelihood decoding ove...
Ioannis Chatzigeorgiou, Miguel R. D. Rodrigues, Ia...
Abstract— In recent years, network coding has been investigated as a method to obtain improvements in wireless networks. A typical assumption of previous work is that relay nodes...