Information Theoretic Bounds for Tensor Rank Minimization over Finite Fields

Details Information Theoretic Bounds for Tensor Rank Minimization over Finite Fields Information Theoretic Bounds for Tensor Rank Minimization over Finite Fields

2011-03-23

arxiv.org/abs/1103.4435v2

Computer Science

Information Theory

Scientific paper

We consider the problem of noiseless and noisy low-rank tensor completion from a set of random linear measurements. In our derivations, we assume that the entries of the tensor belong to a finite field of arbitrary size and that reconstruction is based on a rank minimization framework. The derived results show that the smallest number of measurements needed for exact reconstruction is upper bounded by the product of the rank, the order and the dimension of a cubic tensor. Furthermore, this condition is also sufficient for unique minimization. Similar bounds hold for the noisy rank minimization scenario, except for a scaling function that depends on the channel error probability.

Affiliated with

Also associated with

No associations

Rating

Information Theoretic Bounds for Tensor Rank Minimization over Finite Fields does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Information Theoretic Bounds for Tensor Rank Minimization over Finite Fields, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Information Theoretic Bounds for Tensor Rank Minimization over Finite Fields will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-440649