1 paper
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…