ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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

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

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.