Low-Rank Matrix Recovery using Gabidulin Codes in Characteristic Zero
Information Theory
2016-09-16 v2 Computer Vision and Pattern Recognition
math.IT
Abstract
We present a new approach on low-rank matrix recovery (LRMR) based on Gabidulin Codes. Since most applications of LRMR deal with matrices over infinite fields, we use the recently introduced generalization of Gabidulin codes to fields of characterstic zero. We show that LRMR can be reduced to decoding of Gabidulin codes and discuss which field extensions can be used in the code construction.
Cite
@article{arxiv.1604.04397,
title = {Low-Rank Matrix Recovery using Gabidulin Codes in Characteristic Zero},
author = {Sven Müelich and Sven Puchinger and Martin Bossert},
journal= {arXiv preprint arXiv:1604.04397},
year = {2016}
}
Comments
6 pages, presented at the International Workshop on Algebraic and Combinatorial Coding Theory (ACCT) 2016, submitted to Electronic Notes in Discrete Mathematics (volume devoted to ACCT 2016)