Hardness of approximating the minimum distance of a linear code (Q4679877): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q920926 |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: I. I. Dumer / 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.2002.806118 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2169665116 / rank | |||
Normal rank | |||
Latest revision as of 12:17, 30 July 2024
scientific article; zbMATH DE number 2172484
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness of approximating the minimum distance of a linear code |
scientific article; zbMATH DE number 2172484 |
Statements
Hardness of approximating the minimum distance of a linear code (English)
0 references
31 May 2005
0 references
