Ben lee Volk

activity

20132026

most citedLower Bounds on Stabilizer Rank

8 citations · 16 across the 15 of their papers we have counts for

collaborators

Showing 2015Show all

2 papers · 1 filter

cs.CC2015★ 1 cited

Identity Testing and Lower Bounds for Read- $k$ Oblivious Algebraic Branching Programs

Matthew Anderson, Michael A. Forbes, Ramprasad Saptharishi +2

Read- $k$ oblivious algebraic branching programs are a natural generalization of the well-studied model of read-once oblivious algebraic branching program (ROABPs). In this work, we…

cs.IT2015★ 2 cited

Efficiently decoding Reed-Muller codes from random errors

Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk

Reed-Muller codes encode an $m$ -variate polynomial of degree $r$ by evaluating it on all points in ${0, 1}^{m}$ . We denote this code by $R M (m, r)$ . The minimal distance of $R M (m, r)$ …

Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs

Efficiently decoding Reed-Muller codes from random errors

Identity Testing and Lower Bounds for Read- $k$ Oblivious Algebraic Branching Programs