Low-Rank Matrix Recovery using Gabidulin Codes in Characteristic Zero

Sven Müelich; Sven Puchinger; Martin Bossert

doi:10.1016/j.endm.2017.02.027

Low-Rank Matrix Recovery using Gabidulin Codes in Characteristic Zero

Sven Müelich, Sven Puchinger, Martin Bossert

University of Ulm

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

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.

Original language	English
Pages (from-to)	161-166
Number of pages	6
Journal	Electronic Notes in Discrete Mathematics
Volume	57
DOIs	https://doi.org/10.1016/j.endm.2017.02.027
State	Published - 1 Mar 2017
Externally published	Yes

Keywords

Characteristic Zero
Gabidulin Codes
Low-Rank Matrix Recovery

Access to Document

10.1016/j.endm.2017.02.027

Cite this

@article{68532eb3c242462ea1763e064572d77c,

title = "Low-Rank Matrix Recovery using Gabidulin Codes in Characteristic Zero",

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.",

keywords = "Characteristic Zero, Gabidulin Codes, Low-Rank Matrix Recovery",

author = "Sven M{\"u}elich and Sven Puchinger and Martin Bossert",

note = "Publisher Copyright: {\textcopyright} 2017 Elsevier B.V.",

year = "2017",

month = mar,

day = "1",

doi = "10.1016/j.endm.2017.02.027",

language = "English",

volume = "57",

pages = "161--166",

journal = "Electronic Notes in Discrete Mathematics",

issn = "1571-0653",

publisher = "Elsevier",

}

TY - JOUR

T1 - Low-Rank Matrix Recovery using Gabidulin Codes in Characteristic Zero

AU - Müelich, Sven

AU - Puchinger, Sven

AU - Bossert, Martin

PY - 2017/3/1

Y1 - 2017/3/1

N2 - 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.

AB - 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.

KW - Characteristic Zero

KW - Gabidulin Codes

KW - Low-Rank Matrix Recovery

UR - http://www.scopus.com/inward/record.url?scp=85015383015&partnerID=8YFLogxK

U2 - 10.1016/j.endm.2017.02.027

DO - 10.1016/j.endm.2017.02.027

M3 - Article

AN - SCOPUS:85015383015

SN - 1571-0653

VL - 57

SP - 161

EP - 166

JO - Electronic Notes in Discrete Mathematics

JF - Electronic Notes in Discrete Mathematics

ER -

Low-Rank Matrix Recovery using Gabidulin Codes in Characteristic Zero

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this