Almost-lossless compression of a low-rank random tensor
arXiv:2210.04041
Abstract
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.
This version fixes typos and adds some remarks