V. Lalitha

Orcid: 0000-0003-2874-8910

Affiliations:
  • International Institute of Information Technology, Hyderabad, India
  • Indian Institute of Science Bangalore, India (PhD 2015)


According to our database1, V. Lalitha authored at least 44 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On Distributed Multi-User Secret Sharing with Multiple Secrets per User.
Proceedings of the National Conference on Communications, 2024

2023
Maximally Recoverable Codes With Hierarchical Locality: Constructions and Field-Size Bounds.
IEEE Trans. Inf. Theory, February, 2023

On Gradient Coding With Partial Recovery.
IEEE Trans. Commun., February, 2023

An Optimization Framework Based on Deep Reinforcement Learning Approaches for Prism Blockchain.
IEEE Trans. Serv. Comput., 2023

On the Structure of Higher Order MDS Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2023

2022
On Rack-Aware Cooperative Regenerating Codes and Epsilon-MSCR Codes.
IEEE J. Sel. Areas Inf. Theory, 2022

Properties of Maximally Recoverable Product Codes and Higher Order MDS Codes.
Proceedings of the 27th National Conference on Communications, 2022

Tamo-Barg Codes with Efficient Local Repair.
Proceedings of the IEEE Information Theory Workshop, 2022

Some Results on Maximally Recoverable Codes with Locality and Hierarchical Locality.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
An Umbrella Converse for Data Exchange: Applied to Caching, Computing, and Shuffling.
Entropy, 2021

A Field Size Bound and Constructions of Maximally Recoverable Codes with Hierarchical Locality.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Secure Raptor Encoder and Decoder for Low Storage Blockchain.
Proceedings of the 13th International Conference on COMmunication Systems & NETworkS, 2021

Object Classification Technique for mmWave FMCW Radars using Range-FFT Features.
Proceedings of the 13th International Conference on COMmunication Systems & NETworkS, 2021

2020
Locally Decodable Index Codes.
IEEE Trans. Inf. Theory, 2020

Straggler Mitigation With Tiered Gradient Codes.
IEEE Trans. Commun., 2020

Codes With Minimum Bandwidth Cooperative Local Regeneration.
IEEE Commun. Lett., 2020

On the Polarizing Behavior and Scaling Exponent of Polar Codes with Product Kernels.
Proceedings of the 2020 National Conference on Communications, 2020

An Umbrella Converse for Data Exchange: Applied to Caching, Computing, Shuffling & Rebalancing.
Proceedings of the IEEE Information Theory Workshop, 2020

Rack-Aware Cooperative Regenerating Codes.
Proceedings of the International Symposium on Information Theory and Its Applications, 2020

Coded Data Rebalancing: Fundamental Limits and Constructions.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Secure Regenerating Codes for Reducing Storage and Bootstrap Costs in Sharded Blockchains.
Proceedings of the IEEE International Conference on Blockchain, 2020

2019
Codes With Locality for Two Erasures.
IEEE Trans. Inf. Theory, 2019

On the Scaling Exponent of Polar Codes with Product Kernels.
CoRR, 2019

Maximally Recoverable Codes with Hierarchical Locality.
Proceedings of the National Conference on Communications, 2019

On Epsilon-MSCR Codes for Two Erasures.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Locality in Index Coding for Large Min-Rank.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
On Maximally Recoverable Codes for Product Topologies.
CoRR, 2018

On Locally Decodable Index Codes.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
Locality-aware hybrid coded MapReduce for server-rack architecture.
Proceedings of the 2017 IEEE Information Theory Workshop, 2017

Rate 1/3 index coding: Forbidden and feasible configurations.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
A class of index coding problems with rate 1/3.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
Weight enumerators and higher support weights of maximally recoverable codes.
Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

2014
Codes With Local Regeneration and Erasure Correction.
IEEE Trans. Inf. Theory, 2014

Codes with locality for two erasures.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Evaluation of Codes with Inherent Double Replication for Hadoop.
Proceedings of the 6th USENIX Workshop on Hot Topics in Storage and File Systems, 2014

2013
Linear Coding Schemes for the Distributed Computation of Subspaces.
IEEE J. Sel. Areas Commun., 2013

Explicit MBR all-symbol locality codes.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Codes with local regeneration.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
Optimal linear codes with a local-error-correction property.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
Distributed intrusion detection in the presence of correlated sensor readings: Signal-space and communication-complexity view-point.
Ad Hoc Networks, 2011

Subspace-based DOA estimation using Fractional Lower Order statistics.
Proceedings of the IEEE International Conference on Acoustics, 2011

A nested linear codes approach to distributed function computation over subspaces.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010
DMT of Wireless Networks: An Overview (Invited Paper).
J. Commun., 2010

On the achievable rates of sources having a group alphabet in a distributed source coding setting.
Proceedings of the 48th Annual Allerton Conference on Communication, 2010


  Loading...