Almost-lossless compression of a low-rank random tensor
Minh Thanh Vu·2022-10-08·via cs.IT updates on arXiv.org
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.