On the achievable rates of sources having a group alphabet in a distributed source coding setting. - K. Vinodh; V. Lalitha 001; N. Prakash 001; P. Vijay Kumar; S. Sandeep Pradhan (Allerton, 2010)

DMT of Wireless Networks: An Overview (Invited Paper). - K. Vinodh; N. Prakash 001; V. Lalitha 001; P. Vijay Kumar (J. Commun., 2010)

A nested linear codes approach to distributed function computation over subspaces. - V. Lalitha 001; N. Prakash 001; K. Vinodh; P. Vijay Kumar; S. Sandeep Pradhan (Allerton, 2011)

Subspace-based DOA estimation using Fractional Lower Order statistics. - K. V. S. Hari; V. Lalitha 001 (ICASSP, 2011)

Distributed intrusion detection in the presence of correlated sensor readings: Signal-space and communication-complexity view-point. - N. E. Venkatesan; Tarun Agarwal; V. Lalitha 001; P. Vijay Kumar (Ad Hoc Networks, 2011)

Optimal linear codes with a local-error-correction property. - N. Prakash 001; Govinda M. Kamath; V. Lalitha 001; P. Vijay Kumar (ISIT, 2012)

Codes with local regeneration. - Govinda M. Kamath; N. Prakash 001; V. Lalitha 001; P. Vijay Kumar (ISIT, 2013)

Explicit MBR all-symbol locality codes. - Govinda M. Kamath; Natalia Silberstein; N. Prakash 001; Ankit Singh Rawat; V. Lalitha 001; Onur Ozan Koyluoglu; P. Vijay Kumar; Sriram Vishwanath (ISIT, 2013)

Linear Coding Schemes for the Distributed Computation of Subspaces. - V. Lalitha 001; N. Prakash 001; K. Vinodh; P. Vijay Kumar; S. Sandeep Pradhan (IEEE J. Sel. Areas Commun., 2013)

Evaluation of Codes with Inherent Double Replication for Hadoop. - M. Nikhil Krishnan; N. Prakash 001; V. Lalitha 001; Birenjith Sasidharan; P. Vijay Kumar; Srinivasan Narayanamurthy; Ranjit Kumar; Siddhartha Nandi (HotStorage, 2014)

Codes with locality for two erasures. - N. Prakash 001; V. Lalitha 001; P. Vijay Kumar (ISIT, 2014)

Codes With Local Regeneration and Erasure Correction. - Govinda M. Kamath; N. Prakash 001; V. Lalitha 001; P. Vijay Kumar (IEEE Trans. Inf. Theory, 2014)

Weight enumerators and higher support weights of maximally recoverable codes. - V. Lalitha 001; Satyanarayana V. Lokam (Allerton, 2015)

A class of index coding problems with rate 1/3. - Prasad Krishnan; V. Lalitha 001 (ISIT, 2016)

Rate 1/3 index coding: Forbidden and feasible configurations. - V. Lalitha 001; Prasad Krishnan (ISIT, 2017)

Locality-aware hybrid coded MapReduce for server-rack architecture. - Sneh Gupta; V. Lalitha 001 (ITW, 2017)

On Locally Decodable Index Codes. - Lakshmi Prasad Natarajan; Prasad Krishnan; V. Lalitha 001 (ISIT, 2018)

On Maximally Recoverable Codes for Product Topologies. - D. Shivakrishna; V Arvind Rameshwar 001; V. Lalitha 001; Birenjith Sasidharan (CoRR, 2018)

Locality in Index Coding for Large Min-Rank. - Lakshmi Natarajan 001; Hoang Dau; Prasad Krishnan; V. Lalitha 001 (ISIT, 2019)

On Epsilon-MSCR Codes for Two Erasures. - Bh. Rekha Devi; V. Lalitha 001 (ISIT, 2019)

Maximally Recoverable Codes with Hierarchical Locality. - Aaditya M. Nair; V. Lalitha 001 (NCC, 2019)

On the Scaling Exponent of Polar Codes with Product Kernels. - Manan Bhandari; Ishan Bansal; V. Lalitha 001 (CoRR, 2019)

Codes With Locality for Two Erasures. - N. Prakash 001; V. Lalitha 001; Balaji Srinivasan Babu; P. Vijay Kumar (IEEE Trans. Inf. Theory, 2019)

Secure Regenerating Codes for Reducing Storage and Bootstrap Costs in Sharded Blockchains. - Divija Swetha Gadiraju; V. Lalitha 001; Vaneet Aggarwal (Blockchain, 2020)

Coded Data Rebalancing: Fundamental Limits and Constructions. - Prasad Krishnan; V. Lalitha 001; Lakshmi Natarajan 001 (ISIT, 2020)

Rack-Aware Cooperative Regenerating Codes. - Shreya Gupta; V. Lalitha 001 (ISITA, 2020)

An Umbrella Converse for Data Exchange: Applied to Caching, Computing, Shuffling & Rebalancing. - Prasad Krishnan; Lakshmi Natarajan 001; V. Lalitha 001 (ITW, 2020)

On the Polarizing Behavior and Scaling Exponent of Polar Codes with Product Kernels. - Manan Bhandari; Ishan Bansal; V. Lalitha 001 (NCC, 2020)

Codes With Minimum Bandwidth Cooperative Local Regeneration. - M. Nikhil Krishnan; V. Lalitha 001; Sreeranjani Didugu (IEEE Commun. Lett., 2020)

Straggler Mitigation With Tiered Gradient Codes. - Shanuja Sasi; V. Lalitha 001; Vaneet Aggarwal; B. Sundar Rajan (IEEE Trans. Commun., 2020)

Locally Decodable Index Codes. - Lakshmi Prasad Natarajan; Prasad Krishnan; V. Lalitha 001; Hoang Dau (IEEE Trans. Inf. Theory, 2020)

Object Classification Technique for mmWave FMCW Radars using Range-FFT Features. - Jyoti Bhatia; Aveen Dayal; Ajit Jha; Santosh Kumar Vishvakarma; Soumya J.; M. B. Srinivas; Phaneendra K. Yalavarthy; Abhinav Kumar 001; V. Lalitha 001; Sagar Koorapati; Linga Reddy Cenkeramaddi (COMSNETS, 2021)

Secure Raptor Encoder and Decoder for Low Storage Blockchain. - Aayush Tiwari; V. Lalitha 001 (COMSNETS, 2021)

A Field Size Bound and Constructions of Maximally Recoverable Codes with Hierarchical Locality. - D. Shivakrishna; Aaditya M. Nair; V. Lalitha 001 (ISIT, 2021)

An Umbrella Converse for Data Exchange: Applied to Caching, Computing, and Shuffling. - Prasad Krishnan; Lakshmi Natarajan 001; V. Lalitha 001 (Entropy, 2021)

Some Results on Maximally Recoverable Codes with Locality and Hierarchical Locality. - D. Shivakrishna; V. Lalitha 001 (ISIT, 2022)

Tamo-Barg Codes with Efficient Local Repair. - U. S. S. Sasanka; V. Lalitha 001 (ITW, 2022)

Properties of Maximally Recoverable Product Codes and Higher Order MDS Codes. - D. Shivakrishna; V. Lalitha 001 (NCC, 2022)

On Rack-Aware Cooperative Regenerating Codes and Epsilon-MSCR Codes. - Shreya Gupta; Bh. Rekha Devi; V. Lalitha 001 (IEEE J. Sel. Areas Inf. Theory, 2022)

On the Structure of Higher Order MDS Codes. - Harshithanjani Athi; Rasagna Chigullapally; Prasad Krishnan; V. Lalitha 001 (ISIT, 2023)

An Optimization Framework Based on Deep Reinforcement Learning Approaches for Prism Blockchain. - Divija Swetha Gadiraju; V. Lalitha 001; Vaneet Aggarwal (IEEE Trans. Serv. Comput., 2023)

On Gradient Coding With Partial Recovery. - Sahasrajit Sarmasarkar; V. Lalitha 001; Nikhil Karamchandani (IEEE Trans. Commun., 2023)

Maximally Recoverable Codes With Hierarchical Locality: Constructions and Field-Size Bounds. - D. Shivakrishna; Aaditya M. Nair; V. Lalitha 001 (IEEE Trans. Inf. Theory, 2023)

On Distributed Multi-User Secret Sharing with Multiple Secrets per User. - Rasagna Chigullapally; Harshithanjani Athi; V. Lalitha 001; Nikhil Karamchandani (NCC, 2024)

An Upper Bound on the Error Probability of RPA Decoding of Reed-Muller Codes Over the BSC. - V Arvind Rameshwar 001; V. Lalitha 001 (CoRR, 2024)

On the Service Rate Region of Reed-Muller Codes. - Hoang Ly; Emina Soljanin; V. Lalitha 001 (CoRR, 2025)

On the Efficacy of the Peeling Decoder for the Quantum Expander Code. - Jefrin Sharmitha Prabhu; Abhinav Vaishya; Shobhit Bhatnagar; Aryaman Manish Kolhe; V. Lalitha 001; P. Vijay Kumar (CoRR, 2025)

Maximally recoverable codes with locality and availability. - Umberto Martínez-Peñas; V. Lalitha 001 (CoRR, 2025)

Generalized Dual Discriminator GANs. - Penukonda Naga Chandana; Tejas Srivastava; Gowtham R. Kurri; V. Lalitha 001 (CoRR, 2025)