On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes (Q2976445): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q398978 |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Philippe Gaborit / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1109/tit.2016.2616127 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2963320596 / rank | |||
Normal rank | |||
Latest revision as of 10:20, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes |
scientific article |
Statements
On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes (English)
0 references
28 April 2017
0 references
