Almost-lossless compression of a low-rank random tensor

10/08/2022

∙

by   Minh Thành Vu, et al.

∙

0

∙

share

In this work, we establish an asymptotic limit of almost-lossless compression of a random, finite alphabet tensor which admits a low-rank canonical polyadic decomposition.