The Repair Problem for Reed–Solomon Codes: Optimal Repair of Single and Multiple Erasures With Almost Optimal Node Size (Q5223961): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q128868848, #quickstatements; #temporary_batch_1724808069555 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1109/tit.2018.2884075 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2902882503 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q128868848 / rank | |||
Normal rank | |||
Latest revision as of 02:37, 28 August 2024
scientific article; zbMATH DE number 7082714
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Repair Problem for Reed–Solomon Codes: Optimal Repair of Single and Multiple Erasures With Almost Optimal Node Size |
scientific article; zbMATH DE number 7082714 |
Statements
The Repair Problem for Reed–Solomon Codes: Optimal Repair of Single and Multiple Erasures With Almost Optimal Node Size (English)
0 references
19 July 2019
0 references
