Low-rank matrix recovery using Gabidulin codes in characteristic zero
type: Item
instance of: scholarly article
title: Low-rank matrix recovery using Gabidulin codes in characteristic zero
zbMATH Open document ID: 1439.94096
author: Sven Müelich
author: Sven Puchinger
author: Martin Bossert
publication date: 2018-04-13T00:00:00Z
full work available at URL: https://arxiv.org/abs/1604.04397
Mathematics Subject Classification ID: 94B05
zbMATH DE Number: 6859389
zbMATH Keywords: Gabidulin codes
zbMATH Keywords: characteristic zero
zbMATH Keywords: low-rank matrix recovery
MaRDI profile type: Publication
OpenAlex ID: W2963497038
arXiv ID: 1604.04397
cites work: Exact matrix completion via convex optimization
cites work: The Power of Convex Relaxation: Near-Optimal Matrix Completion
cites work: Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
cites work: Recovering Low-Rank Matrices From Few Coefficients in Any Basis
cites work: Bilinear forms over a finite field, with applications to coding theory
cites work: Theory of codes with maximum rank distance
cites work: Maximum-rank array codes and their application to crisscross error correction
DOI: 10.1016/J.ENDM.2017.02.027
description: scientific article