3 citations · 3 across the 2 of their papers we have counts for
Showing cs.ITShow all
2 papers · 1 filter
cs.IT2021
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…
cs.IT2018
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…