Ladder Matrix Recovery from Permutations
Information Theory
2022-07-25 v1 Commutative Algebra
math.IT
Abstract
We give unique recovery guarantees for matrices of bounded rank that have undergone permutations of their entries. We even do this for a more general matrix structure that we call ladder matrices. We use methods and results of commutative algebra and algebraic geometry, for which we include a preparation as needed for a general audience.
Cite
@article{arxiv.2207.10864,
title = {Ladder Matrix Recovery from Permutations},
author = {Manolis C. Tsakiris},
journal= {arXiv preprint arXiv:2207.10864},
year = {2022}
}
Comments
14 double-column pages