7 citations · 15 across the 7 of their papers we have counts for
8 papers · 1 filter
Maximally Recoverable Codes with Hierarchical Locality: Constructions and Field-Size Bounds
D. Shivakrishna, Aaditya M. Nair, V. Lalitha
Maximally recoverable codes are a class of codes which recover from all potentially recoverable erasure patterns given the locality constraints of the code. In earlier works, these…
Rack-Aware Cooperative Regenerating Codes
Shreya Gupta, V. Lalitha
In distributed storage systems, cooperative regenerating codes tradeoff storage for repair bandwidth in the case of multiple node failures. In rack-aware distributed storage system…
Locally Decodable Index Codes
Lakshmi Natarajan, Prasad Krishnan, V. Lalitha +1
An index code for broadcast channel with receiver side information is locally decodable if each receiver can decode its demand by observing only a subset of the transmitted codewor…
On the Polarizing Behavior and Scaling Exponent of Polar Codes with Product Kernels
Manan Bhandari, Ishan Bansal, V. Lalitha
Polar codes, introduced by Arikan, achieve the capacity of arbitrary binary-input discrete memoryless channel under successive cancellation decoding. Any such channel having ca…
Locality in Index Coding for Large Min-Rank
Lakshmi Natarajan, Hoang Dau, Prasad Krishnan +1
An index code is said to be locally decodable if each receiver can decode its demand using its side information and by querying only a subset of the transmitted codeword symbols in…
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…