codes


The robustness of the tensor product ★★★

Author(s): Ben-Sasson; Sudan

Problem   Given two codes $ R,C $, their Tensor Product $ R \otimes C $ is the code that consists of the matrices whose rows are codewords of $ R $ and whose columns are codewords of $ C $. The product $ R \otimes C $ is said to be robust if whenever a matrix $ M $ is far from $ R \otimes C $, the rows (columns) of $ M $ are far from $ R $ ($ C $, respectively).

The problem is to give a characterization of the pairs $ R,C $ whose tensor product is robust.

Keywords: codes; coding; locally testable; robustness

Syndicate content