Low-rank matrix recovery using Gabidulin codes in characteristic zero

DOI10.1016/j.endm.2017.02.027zbMath1439.94096arXiv1604.04397OpenAlexW2963497038MaRDI QIDQ1743301

Sven Puchinger, Sven Müelich, Martin Bossert

Publication date: 13 April 2018

Full work available at URL: https://arxiv.org/abs/1604.04397

zbMATH Keywords

low-rank matrix recoverycharacteristic zeroGabidulin codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (2)

Systematic encoders for generalized Gabidulin codes and the \(q\)-analogue of Cauchy matrices ⋮ Rank-Metric Codes and Their Applications

Cites Work

• Theory of codes with maximum rank distance
• Bilinear forms over a finite field, with applications to coding theory
• Exact matrix completion via convex optimization
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Recovering Low-Rank Matrices From Few Coefficients in Any Basis
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Maximum-rank array codes and their application to crisscross error correction

This page was built for publication: Low-rank matrix recovery using Gabidulin codes in characteristic zero