# codes

## The robustness of the tensor product ★★★

Author(s): Ben-Sasson; Sudan

**Problem**Given two codes , their

**Tensor Product**is the code that consists of the matrices whose rows are codewords of and whose columns are codewords of . The product is said to be

**robust**if whenever a matrix is far from , the rows (columns) of are far from (, respectively).

The problem is to give a characterization of the pairs whose tensor product is robust.

Keywords: codes; coding; locally testable; robustness