AI Chat AI Image Generator AI Video Text to Speech

Low-Rank Matrix Recovery using Gabidulin Codes in Characteristic Zero

04/15/2016

∙

by Sven Müelich, et al.

∙

∙

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.

Sven Müelich
2 publications
Sven Puchinger
46 publications
Martin Bossert
8 publications

page 1

page 2

page 3

page 4

research

∙ 04/29/2020

Support Constrained Generator Matrices of Gabidulin Codes in Characteristic Zero

Gabidulin codes over fields of characteristic zero were recently constru...

0 Hikmet Yildiz, et al. ∙

research

∙ 01/15/2014

Low-Rank Modeling and Its Applications in Image Analysis

Low-rank modeling generally refers to a class of methods that solve prob...

0 Xiaowei Zhou, et al. ∙

research

∙ 01/21/2019

Reed-Solomon Codes over Fields of Characteristic Zero

We study Reed-Solomon codes over arbitrary fields, inspired by several r...

0 Carmen Sippel, et al. ∙

research

∙ 04/21/2011

Rank Minimization over Finite Fields: Fundamental Limits and Coding-Theoretic Interpretations

This paper establishes information-theoretic limits in estimating a fini...

0 Vincent Y. F. Tan, et al. ∙

research

∙ 07/13/2021

Index Code Construction via Deep Matrix Factorization

In this paper, we consider the problem of on-demand source coding for co...

0 Vaisakh M, et al. ∙

research

∙ 05/16/2023

Parameter optimization for low-rank matrix recovery in hyperspectral imaging

An approach to parameter optimization for the low-rank matrix recovery m...

0 Monika Wolfmayr, et al. ∙

research

∙ 10/01/2020

Deep matrix factorizations

Constrained low-rank matrix approximations have been known for decades a...

0 Pierre De Handschutter, et al. ∙