Bibliographic Details
| Title: |
On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes. |
| Authors: |
Gaborit, Philippe, Zemor, Gilles |
| Source: |
IEEE Transactions on Information Theory; Dec2016, Vol. 62 Issue 12, p7245-7252, 8p |
| Subject Terms: |
HAMMING codes, ERROR-correcting codes, PERFECT codes, LINEAR codes, ALGEBRAIC codes |
| Abstract: |
We give a randomized reduction for the Rank Syndrome Decoding problem and Rank Minimum Distance problem for rank codes over extension fields. Our results are based on embedding linear codes in the Hamming space into linear codes over an extension field equipped with the rank metric. We prove that if any of the previous problems for the rank metric is in ZPP = RP $\cap $ coRP, then we would have NP = ZPP. We also give complexity results for the respective rank metric approximation problems. [ABSTRACT FROM PUBLISHER] |
|
Copyright of IEEE Transactions on Information Theory is the property of IEEE and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Complementary Index |
Full Text Finder 
Nájsť tento článok vo Web of Science