7 citations · 8 across the 4 of their papers we have counts for
4 papers
On Maximally Recoverable Codes for Product Topologies
D. Shivakrishna, V. Arvind Rameshwar, V. Lalitha +1
Given a topology of local parity-check constraints, a maximally recoverable code (MRC) can correct all erasure patterns that are information-theoretically correctable. In a grid-li…
Locality-Aware Hybrid Coded MapReduce for Server-Rack Architecture
Sneh Gupta, V. Lalitha
MapReduce is a widely used framework for distributed computing. Data shuffling between the Map phase and Reduce phase of a job involves a large amount of data transfer across serve…
Rate Index Coding: Forbidden and Feasible Configurations
V. Lalitha, Prasad Krishnan
Linear index coding can be formulated as an interference alignment problem, in which precoding vectors of the minimum possible length are to be assigned to the messages in such a w…
Weight Enumerators and Higher Support Weights of Maximally Recoverable Codes
V. Lalitha, Satyanarayana V. Lokam
In this paper, we establish the matroid structures corresponding to data-local and local maximally recoverable codes (MRC). The matroid structures of these codes can be used to det…