Follow
Shanuja Sasi
Shanuja Sasi
Postdoc, Information Theory and Security Laboratory, Linköping University
Verified email at liu.se
Title
Cited by
Cited by
Year
Multi-access coded caching scheme with linear sub-packetization using PDAs
S Sasi, BS Rajan
IEEE Transactions on Communications 69 (12), 7974-7985, 2021
352021
An improved multi-access coded caching with uncoded placement
S Sasi, BS Rajan
arXiv preprint arXiv:2009.05377, 2020
282020
Straggler mitigation with tiered gradient codes
S Sasi, V Lalitha, V Aggarwal, BS Rajan
IEEE Transactions on Communications 68 (8), 4632-4647, 2020
172020
Code construction for pliable index coding
S Sasi, BS Rajan
2019 IEEE International Symposium on Information Theory (ISIT), 527-531, 2019
132019
On pliable index coding
S Sasi, BS Rajan
arXiv preprint arXiv:1901.05809, 2019
62019
On Optimal Index Codes for Interlinked Cycle Structures with Outer Cycles
S Sasi, BS Rajan
arXiv preprint arXiv:1804.09120, 2018
22018
Rate-limited Shuffling for Distributed Computing
S Sasi, O Günlü
arXiv preprint arXiv:2403.01296, 2024
12024
Multi-access Distributed Computing Models from Map-Reduce Arrays
S Sasi, O Günlü, BS Rajan
arXiv preprint arXiv:2402.16140, 2024
12024
On the structure of interlinked cycle structures with interlocked outer cycles
S Sasi, BS Rajan
arXiv preprint arXiv:1805.00706, 2018
12018
Multi-access Distributed Computing Models using Map-Reduce Arrays
S Sasi, O Günlü, BS Rajan
2024 IEEE International Symposium on Information Theory (ISIT), 1355-1360, 2024
2024
Secure Coded Distributed Computing
S Sasi, O Günlü
arXiv preprint arXiv:2404.16431, 2024
2024
An embedded index code construction using sub-packetization
S Sasi, V Aggarwal, BS Rajan
2020 IEEE Information Theory Workshop (ITW), 1-5, 2021
2021
Optimal Index Codes for Some Interlinked Cycle Structures with Outer Cycles
S Sasi, BS Rajan
2019 IEEE International Symposium on Information Theory (ISIT), 2314-2318, 2019
2019
Contributions on index coding coded caching and gradient coding
S Sasi
Bangalore, 0
The system can't perform the operation now. Try again later.
Articles 1–14