default search action
V. Lalitha 0001
Person information
- affiliation: International Institute of Information Technology, Hyderabad, India
- affiliation (PhD 2015): Indian Institute of Science Bangalore, India
Other persons with the same name
- V. Lalitha 0002 — Multimedia University, Faculty of Information Technology, Cyberjaya, Malaysia
- V. Lalitha 0003 — Mother Teresa Women's University, Kodaikanal, India
- V. Lalitha 0004 — Sathyabama University, Department of MCA, Chennai, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c31]Rasagna Chigullapally, Harshithanjani Athi, V. Lalitha, Nikhil Karamchandani:
On Distributed Multi-User Secret Sharing with Multiple Secrets per User. NCC 2024: 1-6 - 2023
- [j13]Sahasrajit Sarmasarkar, V. Lalitha, Nikhil Karamchandani:
On Gradient Coding With Partial Recovery. IEEE Trans. Commun. 71(2): 644-657 (2023) - [j12]D. Shivakrishna, Aaditya M. Nair, V. Lalitha:
Maximally Recoverable Codes With Hierarchical Locality: Constructions and Field-Size Bounds. IEEE Trans. Inf. Theory 69(2): 842-859 (2023) - [j11]Divija Swetha Gadiraju, V. Lalitha, Vaneet Aggarwal:
An Optimization Framework Based on Deep Reinforcement Learning Approaches for Prism Blockchain. IEEE Trans. Serv. Comput. 16(4): 2451-2461 (2023) - [c30]Harshithanjani Athi, Rasagna Chigullapally, Prasad Krishnan, V. Lalitha:
On the Structure of Higher Order MDS Codes. ISIT 2023: 1009-1014 - [i26]Harshithanjani Athi, Rasagna Chigullapally, Prasad Krishnan, Lalitha Vadlamani:
On the Structure of Higher Order MDS Codes. CoRR abs/2305.05596 (2023) - [i25]Rasagna Chigullapally, Harshithanjani Athi, Nikhil Karamchandani, V. Lalitha:
On Distributed Multi-User Secret Sharing with Multiple Secrets per User. CoRR abs/2312.15763 (2023) - 2022
- [j10]Shreya Gupta, Bh. Rekha Devi, V. Lalitha:
On Rack-Aware Cooperative Regenerating Codes and Epsilon-MSCR Codes. IEEE J. Sel. Areas Inf. Theory 3(2): 362-378 (2022) - [c29]D. Shivakrishna, V. Lalitha:
Some Results on Maximally Recoverable Codes with Locality and Hierarchical Locality. ISIT 2022: 1181-1186 - [c28]U. S. S. Sasanka, V. Lalitha:
Tamo-Barg Codes with Efficient Local Repair. ITW 2022: 529-534 - [c27]D. Shivakrishna, V. Lalitha:
Properties of Maximally Recoverable Product Codes and Higher Order MDS Codes. NCC 2022: 233-238 - 2021
- [j9]Prasad Krishnan, Lakshmi Natarajan, V. Lalitha:
An Umbrella Converse for Data Exchange: Applied to Caching, Computing, and Shuffling. Entropy 23(8): 985 (2021) - [c26]Jyoti Bhatia, Aveen Dayal, Ajit Jha, Santosh Kumar Vishvakarma, Soumya J., M. B. Srinivas, Phaneendra K. Yalavarthy, Abhinav Kumar, V. Lalitha, Sagar Koorapati, Linga Reddy Cenkeramaddi:
Object Classification Technique for mmWave FMCW Radars using Range-FFT Features. COMSNETS 2021: 111-115 - [c25]Aayush Tiwari, V. Lalitha:
Secure Raptor Encoder and Decoder for Low Storage Blockchain. COMSNETS 2021: 161-165 - [c24]D. Shivakrishna, Aaditya M. Nair, V. Lalitha:
A Field Size Bound and Constructions of Maximally Recoverable Codes with Hierarchical Locality. ISIT 2021: 2048-2053 - [c23]Sahasrajit Sarmasarkar, V. Lalitha, Nikhil Karamchandani:
On Gradient Coding with Partial Recovery. ISIT 2021: 2274-2279 - [i24]Sahasrajit Sarmasarkar, V. Lalitha, Nikhil Karamchandani:
On Gradient Coding with Partial Recovery. CoRR abs/2102.10163 (2021) - [i23]Shreya Gupta, V. Lalitha:
Rack-Aware Cooperative Regenerating Codes. CoRR abs/2102.12421 (2021) - [i22]D. Shivakrishna, Aaditya M. Nair, V. Lalitha:
Maximally Recoverable Codes with Hierarchical Locality: Constructions and Field-Size Bounds. CoRR abs/2105.03328 (2021) - 2020
- [j8]M. Nikhil Krishnan, V. Lalitha, Sreeranjani Didugu:
Codes With Minimum Bandwidth Cooperative Local Regeneration. IEEE Commun. Lett. 24(12): 2669-2673 (2020) - [j7]Shanuja Sasi, V. Lalitha, Vaneet Aggarwal, B. Sundar Rajan:
Straggler Mitigation With Tiered Gradient Codes. IEEE Trans. Commun. 68(8): 4632-4647 (2020) - [j6]Lakshmi Prasad Natarajan, Prasad Krishnan, V. Lalitha, Hoang Dau:
Locally Decodable Index Codes. IEEE Trans. Inf. Theory 66(12): 7387-7407 (2020) - [c22]Divija Swetha Gadiraju, V. Lalitha, Vaneet Aggarwal:
Secure Regenerating Codes for Reducing Storage and Bootstrap Costs in Sharded Blockchains. Blockchain 2020: 229-236 - [c21]Prasad Krishnan, V. Lalitha, Lakshmi Natarajan:
Coded Data Rebalancing: Fundamental Limits and Constructions. ISIT 2020: 640-645 - [c20]Shreya Gupta, V. Lalitha:
Rack-Aware Cooperative Regenerating Codes. ISITA 2020: 264-268 - [c19]Prasad Krishnan, Lakshmi Natarajan, V. Lalitha:
An Umbrella Converse for Data Exchange: Applied to Caching, Computing, Shuffling & Rebalancing. ITW 2020: 1-5 - [c18]Manan Bhandari, Ishan Bansal, V. Lalitha:
On the Polarizing Behavior and Scaling Exponent of Polar Codes with Product Kernels. NCC 2020: 1-6 - [i21]Prasad Krishnan, V. Lalitha, Lakshmi Natarajan:
Coded Data Rebalancing: Fundamental Limits and Constructions. CoRR abs/2001.04939 (2020) - [i20]Prasad Krishnan, Lakshmi Natarajan, V. Lalitha:
An Umbrella Converse for Data Exchange: Applied to Caching, Computing, Shuffling & Rebalancing. CoRR abs/2010.10459 (2020) - [i19]Divija Swetha Gadiraju, V. Lalitha, Vaneet Aggarwal:
Secure Regenerating Codes for Reducing Storage and Bootstrap Costs in Sharded Blockchains. CoRR abs/2011.06201 (2020)
2010 – 2019
- 2019
- [j5]N. Prakash, V. Lalitha, Balaji Srinivasan Babu, P. Vijay Kumar:
Codes With Locality for Two Erasures. IEEE Trans. Inf. Theory 65(12): 7771-7789 (2019) - [c17]Lakshmi Natarajan, Hoang Dau, Prasad Krishnan, V. Lalitha:
Locality in Index Coding for Large Min-Rank. ISIT 2019: 517-521 - [c16]Bh. Rekha Devi, V. Lalitha:
On Epsilon-MSCR Codes for Two Erasures. ISIT 2019: 1567-1571 - [c15]Aaditya M. Nair, V. Lalitha:
Maximally Recoverable Codes with Hierarchical Locality. NCC 2019: 1-6 - [i18]Aaditya M. Nair, V. Lalitha:
Maximally Recoverable Codes with Hierarchical Locality. CoRR abs/1901.02867 (2019) - [i17]Lakshmi Natarajan, Hoang Dau, Prasad Krishnan, V. Lalitha:
Locality in Index Coding for Large Min-Rank. CoRR abs/1901.05908 (2019) - [i16]Bh. Rekha Devi, V. Lalitha:
On Epsilon-MSCR Codes for Two Erasures. CoRR abs/1901.06336 (2019) - [i15]Manan Bhandari, Ishan Bansal, V. Lalitha:
On the Scaling Exponent of Polar Codes with Product Kernels. CoRR abs/1904.08682 (2019) - [i14]Shanuja Sasi, V. Lalitha, Vaneet Aggarwal, B. Sundar Rajan:
Straggler Mitigation with Tiered Gradient Codes. CoRR abs/1909.02516 (2019) - [i13]Lakshmi Natarajan, Prasad Krishnan, V. Lalitha, Hoang Dau:
Locally Decodable Index Codes. CoRR abs/1910.08745 (2019) - 2018
- [c14]Lakshmi Prasad Natarajan, Prasad Krishnan, V. Lalitha:
On Locally Decodable Index Codes. ISIT 2018: 446-450 - [i12]D. Shivakrishna, V Arvind Rameshwar, V. Lalitha, Birenjith Sasidharan:
On Maximally Recoverable Codes for Product Topologies. CoRR abs/1801.03379 (2018) - [i11]Lakshmi Prasad Natarajan, Prasad Krishnan, V. Lalitha:
On Locally Decodable Index Codes. CoRR abs/1801.03895 (2018) - 2017
- [c13]V. Lalitha, Prasad Krishnan:
Rate 1/3 index coding: Forbidden and feasible configurations. ISIT 2017: 3070-3074 - [c12]Sneh Gupta, V. Lalitha:
Locality-aware hybrid coded MapReduce for server-rack architecture. ITW 2017: 459-463 - [i10]V. Lalitha, Prasad Krishnan:
Rate 1/3 Index Coding: Forbidden and Feasible Configurations. CoRR abs/1701.06814 (2017) - [i9]Sneh Gupta, V. Lalitha:
Locality-Aware Hybrid Coded MapReduce for Server-Rack Architecture. CoRR abs/1709.01440 (2017) - 2016
- [c11]Prasad Krishnan, V. Lalitha:
A class of index coding problems with rate 1/3. ISIT 2016: 130-134 - [i8]Prasad Krishnan, V. Lalitha:
A class of index coding problems with rate 1/3. CoRR abs/1601.06689 (2016) - 2015
- [c10]V. Lalitha, Satyanarayana V. Lokam:
Weight enumerators and higher support weights of maximally recoverable codes. Allerton 2015: 835-842 - [i7]V. Lalitha, Satyanarayana V. Lokam:
Weight Enumerators and Higher Support Weights of Maximally Recoverable Codes. CoRR abs/1507.01095 (2015) - 2014
- [j4]Govinda M. Kamath, N. Prakash, V. Lalitha, P. Vijay Kumar:
Codes With Local Regeneration and Erasure Correction. IEEE Trans. Inf. Theory 60(8): 4637-4660 (2014) - [c9]M. Nikhil Krishnan, N. Prakash, V. Lalitha, Birenjith Sasidharan, P. Vijay Kumar, Srinivasan Narayanamurthy, Ranjit Kumar, Siddhartha Nandi:
Evaluation of Codes with Inherent Double Replication for Hadoop. HotStorage 2014 - [c8]N. Prakash, V. Lalitha, P. Vijay Kumar:
Codes with locality for two erasures. ISIT 2014: 1962-1966 - [i6]N. Prakash, V. Lalitha, P. Vijay Kumar:
Codes with Locality for Two Erasures. CoRR abs/1401.2422 (2014) - [i5]M. Nikhil Krishnan, N. Prakash, V. Lalitha, Birenjith Sasidharan, P. Vijay Kumar, Srinivasan Narayanamurthy, Ranjit Kumar, Siddhartha Nandi:
Evaluation of Codes with Inherent Double Replication for Hadoop. CoRR abs/1406.6783 (2014) - 2013
- [j3]V. Lalitha, N. Prakash, K. Vinodh, P. Vijay Kumar, S. Sandeep Pradhan:
Linear Coding Schemes for the Distributed Computation of Subspaces. IEEE J. Sel. Areas Commun. 31(4): 678-690 (2013) - [c7]Govinda M. Kamath, Natalia Silberstein, N. Prakash, Ankit Singh Rawat, V. Lalitha, Onur Ozan Koyluoglu, P. Vijay Kumar, Sriram Vishwanath:
Explicit MBR all-symbol locality codes. ISIT 2013: 504-508 - [c6]Govinda M. Kamath, N. Prakash, V. Lalitha, P. Vijay Kumar:
Codes with local regeneration. ISIT 2013: 1606-1610 - [c5]Govinda M. Kamath, N. Prakash, V. Lalitha, P. Vijay Kumar:
Codes with local regeneration. ITA 2013: 1-5 - [i4]Govinda M. Kamath, N. Prakash, V. Lalitha, P. Vijay Kumar, Natalia Silberstein, Ankit Singh Rawat, Onur Ozan Koyluoglu, Sriram Vishwanath:
Explicit MBR All-Symbol Locality Codes. CoRR abs/1302.0744 (2013) - [i3]V. Lalitha, N. Prakash, K. Vinodh, P. Vijay Kumar, S. Sandeep Pradhan:
Linear Coding Schemes for the Distributed Computation of Subspaces. CoRR abs/1302.5021 (2013) - 2012
- [c4]N. Prakash, Govinda M. Kamath, V. Lalitha, P. Vijay Kumar:
Optimal linear codes with a local-error-correction property. ISIT 2012: 2776-2780 - [i2]N. Prakash, Govinda M. Kamath, V. Lalitha, P. Vijay Kumar:
Optimal Linear Codes with a Local-Error-Correction Property. CoRR abs/1202.2414 (2012) - [i1]Govinda M. Kamath, N. Prakash, V. Lalitha, P. Vijay Kumar:
Codes with Local Regeneration. CoRR abs/1211.1932 (2012) - 2011
- [j2]N. E. Venkatesan, Tarun Agarwal, V. Lalitha, P. Vijay Kumar:
Distributed intrusion detection in the presence of correlated sensor readings: Signal-space and communication-complexity view-point. Ad Hoc Networks 9(6): 1015-1027 (2011) - [c3]V. Lalitha, N. Prakash, K. Vinodh, P. Vijay Kumar, S. Sandeep Pradhan:
A nested linear codes approach to distributed function computation over subspaces. Allerton 2011: 1202-1209 - [c2]K. V. S. Hari, V. Lalitha:
Subspace-based DOA estimation using Fractional Lower Order statistics. ICASSP 2011: 2580-2583 - 2010
- [j1]K. Vinodh, N. Prakash, V. Lalitha, P. Vijay Kumar:
DMT of Wireless Networks: An Overview (Invited Paper). J. Commun. 5(4): 265-281 (2010) - [c1]K. Vinodh, V. Lalitha, N. Prakash, P. Vijay Kumar, S. Sandeep Pradhan:
On the achievable rates of sources having a group alphabet in a distributed source coding setting. Allerton 2010: 479-486
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint