Low-rank matrix recovery using Gabidulin codes in characteristic zero
From MaRDI portal
Publication:1743301
DOI10.1016/J.ENDM.2017.02.027zbMATH Open1439.94096arXiv1604.04397OpenAlexW2963497038MaRDI QIDQ1743301FDOQ1743301
Authors: Sven Müelich, Sven Puchinger, Martin Bossert 
Publication date: 13 April 2018
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.
Full work available at URL: https://arxiv.org/abs/1604.04397
Recommendations
- GNMR: a provable one-line algorithm for low rank matrix recovery
- Fast decoding of Gabidulin codes
- On the genericity of maximum rank distance and Gabidulin codes
- Generalized Gabidulin codes over fields of any characteristic
- On the reconstruction of linearized polynomials: a new decoding algorithm for Gabidulin codes.
Cites Work
- Exact matrix completion via convex optimization
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Bilinear forms over a finite field, with applications to coding theory
- Theory of codes with maximum rank distance
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- Maximum-rank array codes and their application to crisscross error correction
Cited In (2)
This page was built for publication: Low-rank matrix recovery using Gabidulin codes in characteristic zero
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1743301)
