Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > ROBUSTNESS:
Reports tagged with robustness:
TR07-061 | 12th July 2007
Or Meir

#### On the Rectangle Method in proofs of Robustness of Tensor Products

Revisions: 4

Given linear two codes R,C, their tensor product $R \otimes C$
consists of all 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 for every matrix M that is far from $R \otimes C$
more >>>

TR07-062 | 15th July 2007
Oded Goldreich, Or Meir

#### The Tensor Product of Two Good Codes Is Not Necessarily Robustly Testable

Revisions: 2

Given two codes R,C, their tensor product $R \otimes C$ consists of all 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 for every matrix M that is far from $R \otimes C$ it ... more >>>

ISSN 1433-8092 | Imprint