1 citations · 1 across the 2 of their papers we have counts for
3 papers
On the Error Probability of RPA Decoding of Reed-Muller Codes over BMS Channels
Dorsa Fathollahi, V. Arvind Rameshwar, V. Lalitha
We analyze the performance of the Recursive Projection-Aggregation (RPA) decoder of Ye and Abbe (2020), for Reed-Muller (RM) codes, over general binary memoryless symmetric (BMS) c…
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…
Dynamic Rank Maximal Matchings
Prajakta Nimbhorkar, Arvind Rameshwar
We consider the problem of matching applicants to posts where applicants have preferences over posts. Thus the input to our problem is a bipartite graph G = (A U P,E), where A deno…