2000 character limit reached
On the hardness of the decoding and the minimum distance problems for rank codes
Published 14 Apr 2014 in cs.CC, cs.IT, and math.IT | (1404.3482v1)
Abstract: In this paper we give a randomized reduction for the Rank Syndrome Decoding problem and Rank Minimum Distance problem for rank codes. Our results are based on an embedding from linear codes equipped with Hamming distance unto linear codes over an extension field equipped with the rank metric. We prove that if both previous problems for rank metric are in ZPP = RP$\cap$coRP, then we would have NP=ZPP. We also give complexity results for the respective approximation problems in rank metric.
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.