2000 character limit reached
Low-Rank Matrix Recovery using Gabidulin Codes in Characteristic Zero
Published 15 Apr 2016 in cs.IT, cs.CV, and math.IT | (1604.04397v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.