Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Revision(s):

Revision #4 to TR07-061 | 16th June 2011 20:53

On the Rectangle Method in proofs of Robustness of Tensor Products

RSS-Feed




Revision #4
Authors: Or Meir
Accepted on: 16th June 2011 20:53
Downloads: 974
Keywords: 


Abstract:

Given two codes $R$ and $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 holds that the rows and columns of $M$ are far on average from $R$ and $C$ respectively. Ben-Sasson and Sudan (ECCC TR04-046) have asked under which conditions the product $R \otimes C$ is robust. So far, a few important families of tensor products were shown to be robust, and a counter-example of a product that is not robust was also given. However, a precise characterization of codes whose tensor product is robust is yet unknown.

In this work, we highlight a common theme in the previous works on the subject, which we call “the rectangle method”. In short, we observe that all proofs of robustness in the previous works are done by constructing a certain “rectangle”, while in the counterexample no such rectangle can be constructed. We then show that a rectangle can be constructed if and only if the tensor product is robust, and therefore the proof strategy of constructing a rectangle is complete.


Revision #3 to TR07-061 | 13th June 2011 16:27

On the Rectangle Method in proofs of Robustness of Tensor Products





Revision #3
Authors: Or Meir
Accepted on: 13th June 2011 16:27
Downloads: 985
Keywords: 


Abstract:

Given two error correcting codes $R$,$C$, their tensor product $R\otimes 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\otimes C$ is said to be robust if, for every matrix $M$ that is far from $R \otimes 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 \otimes C$ is robust. So far, a few important families of tensor products were shown to be robust, and a counter-example of a product that is not robust was also given. However, a precise characterization of codes whose tensor product is robust is yet unknown.

In this work, we highlight a common theme in the previous works on the subject, which we call “The Rectangle Method”. In short, we observe that all proofs of robustness in the previous works are done by constructing a certain “rectangle”, while in the counterexample no such rectangle can be constructed. We then show that a rectangle can be constructed if and only if the tensor product is robust, and therefore the proof strategy of constructing a rectangle is complete.


Revision #2 to TR07-061 | 13th June 2011 16:26

On the Rectangle Method in proofs of Robustness of Tensor Products





Revision #2
Authors: Or Meir
Accepted on: 13th June 2011 16:26
Downloads: 864
Keywords: 


Abstract:

Given two error correcting codes $R$,$C$, their tensor product $R\otimes 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\otimes C$ is said to be robust if, for every matrix $M$ that is far from $R \otimes 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 \otimes C$ is robust. So far, a few important families of tensor products were shown to be robust, and a counter-example of a product that is not robust was also given. However, a precise characterization of codes whose tensor product is robust is yet unknown.

In this work, we highlight a common theme in the previous works on the subject, which we call “The Rectangle Method”. In short, we observe that all proofs of robustness in the previous works are done by constructing a certain “rectangle”, while in the counterexample no such rectangle can be constructed. We then show that a rectangle can be constructed if and only if the tensor product is robust, and therefore the proof strategy of constructing a rectangle is complete.


Revision #1 to TR07-061 | 6th April 2008 00:00

On the Rectangle Method in proofs of Robustness of Tensor Products





Revision #1
Authors: Or Meir
Accepted on: 6th April 2008 00:00
Downloads: 1100
Keywords: 


Abstract:

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 it holds that the rows and columns of M are far from R and C respectively. Ben-Sasson and Sudan (ECCC TR04-046) have asked under which conditions the product R\otimes C is robust. During the last few years, few important families of tensor products were shown to be robust, and a counter-example of a product that is not robust was also given. However, a precise characterization of codes whose tensor product is robust remains unknown.

In this note we highlight a common theme in the above papers, which we call ``The Rectangle Method''. In short, we observe that all proofs of robustness in the above papers are done by constructing a ``rectangle'', while in the counterexample no such rectangle can be constructed. We then show that a rectangle can be constructed if and only if the tensor product is robust, and therefore the proof strategy of constructing a rectangle is complete.


Paper:

TR07-061 | 12th July 2007 00:00

On the Rectangle Method in proofs of Robustness of Tensor Products





TR07-061
Authors: Or Meir
Publication: 12th July 2007 17:50
Downloads: 1107
Keywords: 


Abstract:

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$
it holds that the rows and columns of M are far from R and C
respectively. Ben-Sasson and Sudan (ECCC TR04-046) have asked under
which conditions the product $R \otimes C$ is robust. During the last
few years, few important families of tensor products were shown to
be robust, and a counter-example of a product that is not robust was
also given. However, a precise characterization of codes whose tensor
product is robust remains unknown.

In this note we highlight a common theme in the above papers, which
we call "The Rectangle Method". In short, we observe that all
proofs of robustness in the above papers are done by constructing
a "rectangle", while in the counterexample no such rectangle
can be constructed. We then show that a rectangle can be constructed
if and only if the tensor product is robust, and therefore the proof
strategy of constructing a rectangle is complete.



ISSN 1433-8092 | Imprint