Almost-lossless compression of a low-rank random tensor
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 0 of its 15 references that are in the map. First posted on arXiv 8 Oct 2022.
Builds on
0 of 15 references.
No references here yet.
Built on by
Not cited yet.