A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
On the rectangle method in proofs of robustness of tensor products
2012
Information Processing Letters
Given two error correcting codes R, C, their tensor product R ⊗ C is the error correcting code that consists of all matrices whose rows are codewords of R and whose columns are codewords of C. The code R ⊗ C is said to be robust if, for every matrix M that is far from R⊗C, it holds that the rows and columns of M are far from R and C respectively. Ben-Sasson and Sudan (ECCC TR04-046) asked under which conditions the product R ⊗ C is robust. So far, a few important families of tensor products
doi:10.1016/j.ipl.2011.11.007
fatcat:vjpz4r2khreh7fbal4ldfziw4q