Follow
Ramji Venkataramanan
Title
Cited by
Cited by
Year
Capacity-achieving sparse superposition codes via approximate message passing decoding
C Rush, A Greig, R Venkataramanan
IEEE Transactions on Information Theory 63 (3), 1476-1500, 2017
134*2017
Estimation of low-rank matrices via approximate message passing
A Montanari, R Venkataramanan
Annals of Statistics 49 (1), 321-345, 2021
982021
Finite Sample Analysis of Approximate Message Passing Algorithms
C Rush, R Venkataramanan
IEEE Transactions on Information Theory 64 (11), 7264 - 7286, 2018
932018
Source coding with feed-forward: Rate-distortion theorems and error exponents for a general source
R Venkataramanan, S Sandeep Pradhan
IEEE Transactions on Information Theory 53 (6), 2154-2179, 2007
91*2007
A unifying tutorial on approximate message passing
OY Feng, R Venkataramanan, C Rush, RJ Samworth
Foundations and Trends® in Machine Learning 15 (4), 335-536, 2022
772022
Low-Complexity Interactive Algorithms for Synchronization from Deletions, Insertions, and Substitutions
R Venkataramanan, VN Swamy, K Ramchandran
IEEE Transactions on Information Theory 61 (10), 5670-5689, 2015
58*2015
Lossy compression via sparse linear regression: Computationally efficient encoding and decoding
R Venkataramanan, T Sarkar, S Tatikonda
IEEE Transactions on Information Theory 60 (6), 3265-3278, 2014
462014
Achievable Rates for Channels with Deletions and Insertions
R Venkataramanan, S Tatikonda, K Ramchandran
IEEE Transactions on Information Theory 59 (11), 6990-7013, 2013
462013
Techniques for improving the finite length performance of sparse superposition codes
A Greig, R Venkataramanan
IEEE Transactions on Communications 66 (3), 905-917, 2017
402017
An Achievable Rate Region for the Broadcast Channel with Feedback
R Venkataramanan, SS Pradhan
IEEE Transactions on Information Theory 59 (10), 6175-6191, 2013
402013
Sparse regression codes
R Venkataramanan, S Tatikonda, A Barron
Foundations and Trends in Communications and Information Theory 15 (1-2), 1-195, 2019
382019
Approximate message passing with spectral initialization for generalized linear models
M Mondelli, R Venkataramanan
International Conference on Artificial Intelligence and Statistics, 397-405, 2021
342021
Coding for deletion channels with multiple traces
M Abroshan, R Venkataramanan, L Dolecek, AG i Fabregas
2019 IEEE International Symposium on Information Theory (ISIT), 1372-1376, 2019
342019
Capacity-achieving spatially coupled sparse superposition codes with AMP decoding
C Rush, K Hsieh, R Venkataramanan
IEEE Transactions on Information Theory 67 (7), 4446-4484, 2021
32*2021
A New Achievable Rate Region for the Multiple-Access Channel With Noiseless Feedback
R Venkataramanan, SS Pradhan
IEEE Transactions on Information Theory 57 (12), 8038-8054, 2011
32*2011
The error probability of sparse superposition codes with approximate message passing decoding
C Rush, R Venkataramanan
IEEE Transactions on Information Theory 65 (5), 3278-3303, 2018
29*2018
Estimation in rotationally invariant generalized linear models via approximate message passing
R Venkataramanan, K Kögler, M Mondelli
International Conference on Machine Learning, 22120-22144, 2022
282022
Lossy compression via sparse linear regression: Performance under minimum-distance encoding
R Venkataramanan, A Joseph, S Tatikonda
IEEE Transactions on Information Theory 60 (6), 3254-3264, 2014
27*2014
PCA initialization for approximate message passing in rotationally invariant models
M Mondelli, R Venkataramanan
Advances in Neural Information Processing Systems 34, 29616-29629, 2021
252021
Estimation of frequency offset using warped discrete-Fourier transform
R Venkataramanan, KMM Prabhu
Signal Processing 86 (2), 250-256, 2006
212006
The system can't perform the operation now. Try again later.
Articles 1–20