18 citations · 22 across the 5 of their papers we have counts for
4 papers · 1 filter
Strong Secrecy for General Multiple-Access Wiretap Channels
Manos Athanasakos, Nicholas Kalouptsidis
This paper is concerned with the general multiple access wiretap channel and the existence of codes that accomplish reliability and strong secrecy. Information leakage to the eaves…
Comment on "Asymptotic Achievability of the Cramér-Rao Bound for Noisy Compressive Sampling"
Behtash Babadi, Nicholas Kalouptsidis, Vahid Tarokh
In [1], we proved the asymptotic achievability of the Cramér-Rao bound in the compressive sensing setting in the linear sparsity regime. In the proof, we used an erroneous closed-f…
Greedy Sparsity-Promoting Algorithms for Distributed Learning
Symeon Chouvardas, Gerasimos Mileounis, Nicholas Kalouptsidis +1
This paper focuses on the development of novel greedy techniques for distributed learning under sparsity constraints. Greedy techniques have widely been used in centralized systems…
SPARLS: A Low Complexity Recursive -Regularized Least Squares Algorithm
Behtash Babadi, Nicholas Kalouptsidis, Vahid Tarokh
We develop a Recursive -Regularized Least Squares (SPARLS) algorithm for the estimation of a sparse tap-weight vector in the adaptive filtering setting. The SPARLS a…