The tensor product of two good codes is not necessarily robustly testable
type: Item
instance of: scholarly article
title: The tensor product of two good codes is not necessarily robustly testable
zbMATH Open document ID: 1243.94046
author: Oded Goldreich
author: Or Meir
published in: Information Processing Letters
publication date: 2012-07-20T00:00:00Z
Mathematics Subject Classification ID: 94B60
Mathematics Subject Classification ID: 94B25
zbMATH DE Number: 6059110
zbMATH Keywords: locally testable codes
zbMATH Keywords: robust
zbMATH Keywords: robustness
zbMATH Keywords: tensor product
zbMATH Keywords: product code
MaRDI profile type: Publication
full work available at URL: j.ipl.2012.01.007
OpenAlex ID: W2030221686
cites work: Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
cites work: Robust locally testable codes and products of codes
cites work: Short PCPs with Polylog Query Complexity
cites work: Composition of Semi-LTCs by Two-Wise Tensor Products
cites work: Q3002812
cites work: The PCP theorem by gap amplification
cites work: Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem
cites work: Robust Local Testability of Tensor Products of LDPC Codes
cites work: Short Locally Testable Codes and Proofs
cites work: Locally testable codes and PCPs of almost-linear length
cites work: On the rectangle method in proofs of robustness of tensor products
cites work: Combinatorial Construction of Locally Testable Codes
cites work: Nearly-linear size holographic proofs
cites work: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
cites work: Q3250141
cites work: A Combination of Testability and Decodability by Tensor Products
DOI: 10.1016/J.IPL.2012.01.007
description: scientific article; zbMATH DE number 6059110