Error-Correcting Regenerating and Locally Repairable Codes via Rank-Metric Codes
This paper presents and analyzes a novel concatenated coding scheme for enabling error resilience in two distributed storage settings: one being storage using existing regenerating codes and the second being storage using locally repairable codes. The concatenated coding scheme brings together a max...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Silberstein, Natalia [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2015 |
|---|
| Schlagwörter: |
|---|
| Systematik: |
|
|---|
| Übergeordnetes Werk: |
Enthalten in: IEEE transactions on information theory - Piscataway, NJ : IEEE, 1963, 61(2015), 11, Seite 5765-5778 |
|---|---|
| Übergeordnetes Werk: |
volume:61 ; year:2015 ; number:11 ; pages:5765-5778 |
| Links: |
|---|
| DOI / URN: |
10.1109/TIT.2015.2480848 |
|---|
| Katalog-ID: |
OLC1963916670 |
|---|
| LEADER | 01000caa a2200265 4500 | ||
|---|---|---|---|
| 001 | OLC1963916670 | ||
| 003 | DE-627 | ||
| 005 | 20220221163256.0 | ||
| 007 | tu | ||
| 008 | 160206s2015 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1109/TIT.2015.2480848 |2 doi | |
| 028 | 5 | 2 | |a PQ20160617 |
| 035 | |a (DE-627)OLC1963916670 | ||
| 035 | |a (DE-599)GBVOLC1963916670 | ||
| 035 | |a (PRQ)c2091-69cc254fbcac577520d45eae256e15d8e1fa13f8d36deaaf0087dc2dd7b005960 | ||
| 035 | |a (KEY)0023448620150000061001105765errorcorrectingregeneratingandlocallyrepairablecod | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 070 |a 620 |q DNB |
| 084 | |a SA 5570 |q AVZ |2 rvk | ||
| 100 | 1 | |a Silberstein, Natalia |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Error-Correcting Regenerating and Locally Repairable Codes via Rank-Metric Codes |
| 264 | 1 | |c 2015 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 520 | |a This paper presents and analyzes a novel concatenated coding scheme for enabling error resilience in two distributed storage settings: one being storage using existing regenerating codes and the second being storage using locally repairable codes. The concatenated coding scheme brings together a maximum rank distance code as an outer code and either a globally regenerating or a locally repairable code as an inner code. In addition, error resilience for combination of locally repairable codes with regenerating codes is considered. This concatenated coding system is designed to handle two different types of adversarial errors: the first type includes an adversary that can replace the content of an affected node only once; while the second type studies an adversary that is capable of polluting data an unbounded number of times. The paper establishes an upper bound on the resilience capacity for a locally repairable code. This paper also proves that the proposed concatenated coding approach attains the upper bound on the resilience capacity in the presence of the first type of adversary for both minimum storage regenerating codes and locally repairable codes. Further, this paper presents mechanisms that combine the presented concatenated coding scheme with subspace signatures to achieve error resilience for the second type of errors. | ||
| 650 | 4 | |a Resilience | |
| 650 | 4 | |a Coding for distributed storage systems | |
| 650 | 4 | |a Upper bound | |
| 650 | 4 | |a rank-metric codes | |
| 650 | 4 | |a Encoding | |
| 650 | 4 | |a Decision support systems | |
| 650 | 4 | |a locally repairable codes | |
| 650 | 4 | |a error correcting codes | |
| 650 | 4 | |a regenerating codes | |
| 650 | 4 | |a Arrays | |
| 650 | 4 | |a Bandwidth | |
| 650 | 4 | |a Maintenance engineering | |
| 650 | 4 | |a Errors | |
| 650 | 4 | |a Codes | |
| 650 | 4 | |a Information theory | |
| 650 | 4 | |a Arrays (Data structures) | |
| 650 | 4 | |a Error-correcting codes | |
| 650 | 4 | |a Analysis | |
| 650 | 4 | |a Usage | |
| 700 | 1 | |a Rawat, Ankit Singh |4 oth | |
| 700 | 1 | |a Vishwanath, Sriram |4 oth | |
| 773 | 0 | 8 | |i Enthalten in |t IEEE transactions on information theory |d Piscataway, NJ : IEEE, 1963 |g 61(2015), 11, Seite 5765-5778 |w (DE-627)12954731X |w (DE-600)218505-2 |w (DE-576)01499819X |x 0018-9448 |7 nnns |
| 773 | 1 | 8 | |g volume:61 |g year:2015 |g number:11 |g pages:5765-5778 |
| 856 | 4 | 1 | |u http://dx.doi.org/10.1109/TIT.2015.2480848 |3 Volltext |
| 856 | 4 | 2 | |u http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=7273884 |
| 856 | 4 | 2 | |u http://search.proquest.com/docview/1728001903 |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-TEC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a SSG-OLC-BUB | ||
| 912 | |a SSG-OPC-BBI | ||
| 912 | |a GBV_ILN_65 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_2002 | ||
| 912 | |a GBV_ILN_2088 | ||
| 912 | |a GBV_ILN_4318 | ||
| 936 | r | v | |a SA 5570 |
| 951 | |a AR | ||
| 952 | |d 61 |j 2015 |e 11 |h 5765-5778 | ||
| author_variant |
n s ns |
|---|---|
| matchkey_str |
article:00189448:2015----::rocretnrgnrtnadoalrpialcd |
| hierarchy_sort_str |
2015 |
| publishDate |
2015 |
| allfields |
10.1109/TIT.2015.2480848 doi PQ20160617 (DE-627)OLC1963916670 (DE-599)GBVOLC1963916670 (PRQ)c2091-69cc254fbcac577520d45eae256e15d8e1fa13f8d36deaaf0087dc2dd7b005960 (KEY)0023448620150000061001105765errorcorrectingregeneratingandlocallyrepairablecod DE-627 ger DE-627 rakwb eng 070 620 DNB SA 5570 AVZ rvk Silberstein, Natalia verfasserin aut Error-Correcting Regenerating and Locally Repairable Codes via Rank-Metric Codes 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier This paper presents and analyzes a novel concatenated coding scheme for enabling error resilience in two distributed storage settings: one being storage using existing regenerating codes and the second being storage using locally repairable codes. The concatenated coding scheme brings together a maximum rank distance code as an outer code and either a globally regenerating or a locally repairable code as an inner code. In addition, error resilience for combination of locally repairable codes with regenerating codes is considered. This concatenated coding system is designed to handle two different types of adversarial errors: the first type includes an adversary that can replace the content of an affected node only once; while the second type studies an adversary that is capable of polluting data an unbounded number of times. The paper establishes an upper bound on the resilience capacity for a locally repairable code. This paper also proves that the proposed concatenated coding approach attains the upper bound on the resilience capacity in the presence of the first type of adversary for both minimum storage regenerating codes and locally repairable codes. Further, this paper presents mechanisms that combine the presented concatenated coding scheme with subspace signatures to achieve error resilience for the second type of errors. Resilience Coding for distributed storage systems Upper bound rank-metric codes Encoding Decision support systems locally repairable codes error correcting codes regenerating codes Arrays Bandwidth Maintenance engineering Errors Codes Information theory Arrays (Data structures) Error-correcting codes Analysis Usage Rawat, Ankit Singh oth Vishwanath, Sriram oth Enthalten in IEEE transactions on information theory Piscataway, NJ : IEEE, 1963 61(2015), 11, Seite 5765-5778 (DE-627)12954731X (DE-600)218505-2 (DE-576)01499819X 0018-9448 nnns volume:61 year:2015 number:11 pages:5765-5778 http://dx.doi.org/10.1109/TIT.2015.2480848 Volltext http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=7273884 http://search.proquest.com/docview/1728001903 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-BBI GBV_ILN_65 GBV_ILN_70 GBV_ILN_2002 GBV_ILN_2088 GBV_ILN_4318 SA 5570 AR 61 2015 11 5765-5778 |
| spelling |
10.1109/TIT.2015.2480848 doi PQ20160617 (DE-627)OLC1963916670 (DE-599)GBVOLC1963916670 (PRQ)c2091-69cc254fbcac577520d45eae256e15d8e1fa13f8d36deaaf0087dc2dd7b005960 (KEY)0023448620150000061001105765errorcorrectingregeneratingandlocallyrepairablecod DE-627 ger DE-627 rakwb eng 070 620 DNB SA 5570 AVZ rvk Silberstein, Natalia verfasserin aut Error-Correcting Regenerating and Locally Repairable Codes via Rank-Metric Codes 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier This paper presents and analyzes a novel concatenated coding scheme for enabling error resilience in two distributed storage settings: one being storage using existing regenerating codes and the second being storage using locally repairable codes. The concatenated coding scheme brings together a maximum rank distance code as an outer code and either a globally regenerating or a locally repairable code as an inner code. In addition, error resilience for combination of locally repairable codes with regenerating codes is considered. This concatenated coding system is designed to handle two different types of adversarial errors: the first type includes an adversary that can replace the content of an affected node only once; while the second type studies an adversary that is capable of polluting data an unbounded number of times. The paper establishes an upper bound on the resilience capacity for a locally repairable code. This paper also proves that the proposed concatenated coding approach attains the upper bound on the resilience capacity in the presence of the first type of adversary for both minimum storage regenerating codes and locally repairable codes. Further, this paper presents mechanisms that combine the presented concatenated coding scheme with subspace signatures to achieve error resilience for the second type of errors. Resilience Coding for distributed storage systems Upper bound rank-metric codes Encoding Decision support systems locally repairable codes error correcting codes regenerating codes Arrays Bandwidth Maintenance engineering Errors Codes Information theory Arrays (Data structures) Error-correcting codes Analysis Usage Rawat, Ankit Singh oth Vishwanath, Sriram oth Enthalten in IEEE transactions on information theory Piscataway, NJ : IEEE, 1963 61(2015), 11, Seite 5765-5778 (DE-627)12954731X (DE-600)218505-2 (DE-576)01499819X 0018-9448 nnns volume:61 year:2015 number:11 pages:5765-5778 http://dx.doi.org/10.1109/TIT.2015.2480848 Volltext http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=7273884 http://search.proquest.com/docview/1728001903 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-BBI GBV_ILN_65 GBV_ILN_70 GBV_ILN_2002 GBV_ILN_2088 GBV_ILN_4318 SA 5570 AR 61 2015 11 5765-5778 |
| allfields_unstemmed |
10.1109/TIT.2015.2480848 doi PQ20160617 (DE-627)OLC1963916670 (DE-599)GBVOLC1963916670 (PRQ)c2091-69cc254fbcac577520d45eae256e15d8e1fa13f8d36deaaf0087dc2dd7b005960 (KEY)0023448620150000061001105765errorcorrectingregeneratingandlocallyrepairablecod DE-627 ger DE-627 rakwb eng 070 620 DNB SA 5570 AVZ rvk Silberstein, Natalia verfasserin aut Error-Correcting Regenerating and Locally Repairable Codes via Rank-Metric Codes 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier This paper presents and analyzes a novel concatenated coding scheme for enabling error resilience in two distributed storage settings: one being storage using existing regenerating codes and the second being storage using locally repairable codes. The concatenated coding scheme brings together a maximum rank distance code as an outer code and either a globally regenerating or a locally repairable code as an inner code. In addition, error resilience for combination of locally repairable codes with regenerating codes is considered. This concatenated coding system is designed to handle two different types of adversarial errors: the first type includes an adversary that can replace the content of an affected node only once; while the second type studies an adversary that is capable of polluting data an unbounded number of times. The paper establishes an upper bound on the resilience capacity for a locally repairable code. This paper also proves that the proposed concatenated coding approach attains the upper bound on the resilience capacity in the presence of the first type of adversary for both minimum storage regenerating codes and locally repairable codes. Further, this paper presents mechanisms that combine the presented concatenated coding scheme with subspace signatures to achieve error resilience for the second type of errors. Resilience Coding for distributed storage systems Upper bound rank-metric codes Encoding Decision support systems locally repairable codes error correcting codes regenerating codes Arrays Bandwidth Maintenance engineering Errors Codes Information theory Arrays (Data structures) Error-correcting codes Analysis Usage Rawat, Ankit Singh oth Vishwanath, Sriram oth Enthalten in IEEE transactions on information theory Piscataway, NJ : IEEE, 1963 61(2015), 11, Seite 5765-5778 (DE-627)12954731X (DE-600)218505-2 (DE-576)01499819X 0018-9448 nnns volume:61 year:2015 number:11 pages:5765-5778 http://dx.doi.org/10.1109/TIT.2015.2480848 Volltext http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=7273884 http://search.proquest.com/docview/1728001903 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-BBI GBV_ILN_65 GBV_ILN_70 GBV_ILN_2002 GBV_ILN_2088 GBV_ILN_4318 SA 5570 AR 61 2015 11 5765-5778 |
| allfieldsGer |
10.1109/TIT.2015.2480848 doi PQ20160617 (DE-627)OLC1963916670 (DE-599)GBVOLC1963916670 (PRQ)c2091-69cc254fbcac577520d45eae256e15d8e1fa13f8d36deaaf0087dc2dd7b005960 (KEY)0023448620150000061001105765errorcorrectingregeneratingandlocallyrepairablecod DE-627 ger DE-627 rakwb eng 070 620 DNB SA 5570 AVZ rvk Silberstein, Natalia verfasserin aut Error-Correcting Regenerating and Locally Repairable Codes via Rank-Metric Codes 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier This paper presents and analyzes a novel concatenated coding scheme for enabling error resilience in two distributed storage settings: one being storage using existing regenerating codes and the second being storage using locally repairable codes. The concatenated coding scheme brings together a maximum rank distance code as an outer code and either a globally regenerating or a locally repairable code as an inner code. In addition, error resilience for combination of locally repairable codes with regenerating codes is considered. This concatenated coding system is designed to handle two different types of adversarial errors: the first type includes an adversary that can replace the content of an affected node only once; while the second type studies an adversary that is capable of polluting data an unbounded number of times. The paper establishes an upper bound on the resilience capacity for a locally repairable code. This paper also proves that the proposed concatenated coding approach attains the upper bound on the resilience capacity in the presence of the first type of adversary for both minimum storage regenerating codes and locally repairable codes. Further, this paper presents mechanisms that combine the presented concatenated coding scheme with subspace signatures to achieve error resilience for the second type of errors. Resilience Coding for distributed storage systems Upper bound rank-metric codes Encoding Decision support systems locally repairable codes error correcting codes regenerating codes Arrays Bandwidth Maintenance engineering Errors Codes Information theory Arrays (Data structures) Error-correcting codes Analysis Usage Rawat, Ankit Singh oth Vishwanath, Sriram oth Enthalten in IEEE transactions on information theory Piscataway, NJ : IEEE, 1963 61(2015), 11, Seite 5765-5778 (DE-627)12954731X (DE-600)218505-2 (DE-576)01499819X 0018-9448 nnns volume:61 year:2015 number:11 pages:5765-5778 http://dx.doi.org/10.1109/TIT.2015.2480848 Volltext http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=7273884 http://search.proquest.com/docview/1728001903 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-BBI GBV_ILN_65 GBV_ILN_70 GBV_ILN_2002 GBV_ILN_2088 GBV_ILN_4318 SA 5570 AR 61 2015 11 5765-5778 |
| allfieldsSound |
10.1109/TIT.2015.2480848 doi PQ20160617 (DE-627)OLC1963916670 (DE-599)GBVOLC1963916670 (PRQ)c2091-69cc254fbcac577520d45eae256e15d8e1fa13f8d36deaaf0087dc2dd7b005960 (KEY)0023448620150000061001105765errorcorrectingregeneratingandlocallyrepairablecod DE-627 ger DE-627 rakwb eng 070 620 DNB SA 5570 AVZ rvk Silberstein, Natalia verfasserin aut Error-Correcting Regenerating and Locally Repairable Codes via Rank-Metric Codes 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier This paper presents and analyzes a novel concatenated coding scheme for enabling error resilience in two distributed storage settings: one being storage using existing regenerating codes and the second being storage using locally repairable codes. The concatenated coding scheme brings together a maximum rank distance code as an outer code and either a globally regenerating or a locally repairable code as an inner code. In addition, error resilience for combination of locally repairable codes with regenerating codes is considered. This concatenated coding system is designed to handle two different types of adversarial errors: the first type includes an adversary that can replace the content of an affected node only once; while the second type studies an adversary that is capable of polluting data an unbounded number of times. The paper establishes an upper bound on the resilience capacity for a locally repairable code. This paper also proves that the proposed concatenated coding approach attains the upper bound on the resilience capacity in the presence of the first type of adversary for both minimum storage regenerating codes and locally repairable codes. Further, this paper presents mechanisms that combine the presented concatenated coding scheme with subspace signatures to achieve error resilience for the second type of errors. Resilience Coding for distributed storage systems Upper bound rank-metric codes Encoding Decision support systems locally repairable codes error correcting codes regenerating codes Arrays Bandwidth Maintenance engineering Errors Codes Information theory Arrays (Data structures) Error-correcting codes Analysis Usage Rawat, Ankit Singh oth Vishwanath, Sriram oth Enthalten in IEEE transactions on information theory Piscataway, NJ : IEEE, 1963 61(2015), 11, Seite 5765-5778 (DE-627)12954731X (DE-600)218505-2 (DE-576)01499819X 0018-9448 nnns volume:61 year:2015 number:11 pages:5765-5778 http://dx.doi.org/10.1109/TIT.2015.2480848 Volltext http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=7273884 http://search.proquest.com/docview/1728001903 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-BBI GBV_ILN_65 GBV_ILN_70 GBV_ILN_2002 GBV_ILN_2088 GBV_ILN_4318 SA 5570 AR 61 2015 11 5765-5778 |
| language |
English |
| source |
Enthalten in IEEE transactions on information theory 61(2015), 11, Seite 5765-5778 volume:61 year:2015 number:11 pages:5765-5778 |
| sourceStr |
Enthalten in IEEE transactions on information theory 61(2015), 11, Seite 5765-5778 volume:61 year:2015 number:11 pages:5765-5778 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Resilience Coding for distributed storage systems Upper bound rank-metric codes Encoding Decision support systems locally repairable codes error correcting codes regenerating codes Arrays Bandwidth Maintenance engineering Errors Codes Information theory Arrays (Data structures) Error-correcting codes Analysis Usage |
| dewey-raw |
070 |
| isfreeaccess_bool |
false |
| container_title |
IEEE transactions on information theory |
| authorswithroles_txt_mv |
Silberstein, Natalia @@aut@@ Rawat, Ankit Singh @@oth@@ Vishwanath, Sriram @@oth@@ |
| publishDateDaySort_date |
2015-01-01T00:00:00Z |
| hierarchy_top_id |
12954731X |
| dewey-sort |
270 |
| id |
OLC1963916670 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">OLC1963916670</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220221163256.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">160206s2015 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1109/TIT.2015.2480848</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20160617</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1963916670</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1963916670</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)c2091-69cc254fbcac577520d45eae256e15d8e1fa13f8d36deaaf0087dc2dd7b005960</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0023448620150000061001105765errorcorrectingregeneratingandlocallyrepairablecod</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">070</subfield><subfield code="a">620</subfield><subfield code="q">DNB</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SA 5570</subfield><subfield code="q">AVZ</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Silberstein, Natalia</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Error-Correcting Regenerating and Locally Repairable Codes via Rank-Metric Codes</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2015</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This paper presents and analyzes a novel concatenated coding scheme for enabling error resilience in two distributed storage settings: one being storage using existing regenerating codes and the second being storage using locally repairable codes. The concatenated coding scheme brings together a maximum rank distance code as an outer code and either a globally regenerating or a locally repairable code as an inner code. In addition, error resilience for combination of locally repairable codes with regenerating codes is considered. This concatenated coding system is designed to handle two different types of adversarial errors: the first type includes an adversary that can replace the content of an affected node only once; while the second type studies an adversary that is capable of polluting data an unbounded number of times. The paper establishes an upper bound on the resilience capacity for a locally repairable code. This paper also proves that the proposed concatenated coding approach attains the upper bound on the resilience capacity in the presence of the first type of adversary for both minimum storage regenerating codes and locally repairable codes. Further, this paper presents mechanisms that combine the presented concatenated coding scheme with subspace signatures to achieve error resilience for the second type of errors.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Resilience</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Coding for distributed storage systems</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Upper bound</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">rank-metric codes</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Encoding</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Decision support systems</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">locally repairable codes</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">error correcting codes</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">regenerating codes</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Arrays</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Bandwidth</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Maintenance engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Errors</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Codes</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Information theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Arrays (Data structures)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Error-correcting codes</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Analysis</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Usage</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Rawat, Ankit Singh</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Vishwanath, Sriram</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">IEEE transactions on information theory</subfield><subfield code="d">Piscataway, NJ : IEEE, 1963</subfield><subfield code="g">61(2015), 11, Seite 5765-5778</subfield><subfield code="w">(DE-627)12954731X</subfield><subfield code="w">(DE-600)218505-2</subfield><subfield code="w">(DE-576)01499819X</subfield><subfield code="x">0018-9448</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:61</subfield><subfield code="g">year:2015</subfield><subfield code="g">number:11</subfield><subfield code="g">pages:5765-5778</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://dx.doi.org/10.1109/TIT.2015.2480848</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=7273884</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://search.proquest.com/docview/1728001903</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-BUB</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-BBI</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2002</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="936" ind1="r" ind2="v"><subfield code="a">SA 5570</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">61</subfield><subfield code="j">2015</subfield><subfield code="e">11</subfield><subfield code="h">5765-5778</subfield></datafield></record></collection>
|
| author |
Silberstein, Natalia |
| spellingShingle |
Silberstein, Natalia ddc 070 rvk SA 5570 misc Resilience misc Coding for distributed storage systems misc Upper bound misc rank-metric codes misc Encoding misc Decision support systems misc locally repairable codes misc error correcting codes misc regenerating codes misc Arrays misc Bandwidth misc Maintenance engineering misc Errors misc Codes misc Information theory misc Arrays (Data structures) misc Error-correcting codes misc Analysis misc Usage Error-Correcting Regenerating and Locally Repairable Codes via Rank-Metric Codes |
| authorStr |
Silberstein, Natalia |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)12954731X |
| format |
Article |
| dewey-ones |
070 - News media, journalism & publishing 620 - Engineering & allied operations |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0018-9448 |
| topic_title |
070 620 DNB SA 5570 AVZ rvk Error-Correcting Regenerating and Locally Repairable Codes via Rank-Metric Codes Resilience Coding for distributed storage systems Upper bound rank-metric codes Encoding Decision support systems locally repairable codes error correcting codes regenerating codes Arrays Bandwidth Maintenance engineering Errors Codes Information theory Arrays (Data structures) Error-correcting codes Analysis Usage |
| topic |
ddc 070 rvk SA 5570 misc Resilience misc Coding for distributed storage systems misc Upper bound misc rank-metric codes misc Encoding misc Decision support systems misc locally repairable codes misc error correcting codes misc regenerating codes misc Arrays misc Bandwidth misc Maintenance engineering misc Errors misc Codes misc Information theory misc Arrays (Data structures) misc Error-correcting codes misc Analysis misc Usage |
| topic_unstemmed |
ddc 070 rvk SA 5570 misc Resilience misc Coding for distributed storage systems misc Upper bound misc rank-metric codes misc Encoding misc Decision support systems misc locally repairable codes misc error correcting codes misc regenerating codes misc Arrays misc Bandwidth misc Maintenance engineering misc Errors misc Codes misc Information theory misc Arrays (Data structures) misc Error-correcting codes misc Analysis misc Usage |
| topic_browse |
ddc 070 rvk SA 5570 misc Resilience misc Coding for distributed storage systems misc Upper bound misc rank-metric codes misc Encoding misc Decision support systems misc locally repairable codes misc error correcting codes misc regenerating codes misc Arrays misc Bandwidth misc Maintenance engineering misc Errors misc Codes misc Information theory misc Arrays (Data structures) misc Error-correcting codes misc Analysis misc Usage |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| author2_variant |
a s r as asr s v sv |
| hierarchy_parent_title |
IEEE transactions on information theory |
| hierarchy_parent_id |
12954731X |
| dewey-tens |
070 - News media, journalism & publishing 620 - Engineering |
| hierarchy_top_title |
IEEE transactions on information theory |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)12954731X (DE-600)218505-2 (DE-576)01499819X |
| title |
Error-Correcting Regenerating and Locally Repairable Codes via Rank-Metric Codes |
| ctrlnum |
(DE-627)OLC1963916670 (DE-599)GBVOLC1963916670 (PRQ)c2091-69cc254fbcac577520d45eae256e15d8e1fa13f8d36deaaf0087dc2dd7b005960 (KEY)0023448620150000061001105765errorcorrectingregeneratingandlocallyrepairablecod |
| title_full |
Error-Correcting Regenerating and Locally Repairable Codes via Rank-Metric Codes |
| author_sort |
Silberstein, Natalia |
| journal |
IEEE transactions on information theory |
| journalStr |
IEEE transactions on information theory |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works 600 - Technology |
| recordtype |
marc |
| publishDateSort |
2015 |
| contenttype_str_mv |
txt |
| container_start_page |
5765 |
| author_browse |
Silberstein, Natalia |
| container_volume |
61 |
| class |
070 620 DNB SA 5570 AVZ rvk |
| format_se |
Aufsätze |
| author-letter |
Silberstein, Natalia |
| doi_str_mv |
10.1109/TIT.2015.2480848 |
| dewey-full |
070 620 |
| title_sort |
error-correcting regenerating and locally repairable codes via rank-metric codes |
| title_auth |
Error-Correcting Regenerating and Locally Repairable Codes via Rank-Metric Codes |
| abstract |
This paper presents and analyzes a novel concatenated coding scheme for enabling error resilience in two distributed storage settings: one being storage using existing regenerating codes and the second being storage using locally repairable codes. The concatenated coding scheme brings together a maximum rank distance code as an outer code and either a globally regenerating or a locally repairable code as an inner code. In addition, error resilience for combination of locally repairable codes with regenerating codes is considered. This concatenated coding system is designed to handle two different types of adversarial errors: the first type includes an adversary that can replace the content of an affected node only once; while the second type studies an adversary that is capable of polluting data an unbounded number of times. The paper establishes an upper bound on the resilience capacity for a locally repairable code. This paper also proves that the proposed concatenated coding approach attains the upper bound on the resilience capacity in the presence of the first type of adversary for both minimum storage regenerating codes and locally repairable codes. Further, this paper presents mechanisms that combine the presented concatenated coding scheme with subspace signatures to achieve error resilience for the second type of errors. |
| abstractGer |
This paper presents and analyzes a novel concatenated coding scheme for enabling error resilience in two distributed storage settings: one being storage using existing regenerating codes and the second being storage using locally repairable codes. The concatenated coding scheme brings together a maximum rank distance code as an outer code and either a globally regenerating or a locally repairable code as an inner code. In addition, error resilience for combination of locally repairable codes with regenerating codes is considered. This concatenated coding system is designed to handle two different types of adversarial errors: the first type includes an adversary that can replace the content of an affected node only once; while the second type studies an adversary that is capable of polluting data an unbounded number of times. The paper establishes an upper bound on the resilience capacity for a locally repairable code. This paper also proves that the proposed concatenated coding approach attains the upper bound on the resilience capacity in the presence of the first type of adversary for both minimum storage regenerating codes and locally repairable codes. Further, this paper presents mechanisms that combine the presented concatenated coding scheme with subspace signatures to achieve error resilience for the second type of errors. |
| abstract_unstemmed |
This paper presents and analyzes a novel concatenated coding scheme for enabling error resilience in two distributed storage settings: one being storage using existing regenerating codes and the second being storage using locally repairable codes. The concatenated coding scheme brings together a maximum rank distance code as an outer code and either a globally regenerating or a locally repairable code as an inner code. In addition, error resilience for combination of locally repairable codes with regenerating codes is considered. This concatenated coding system is designed to handle two different types of adversarial errors: the first type includes an adversary that can replace the content of an affected node only once; while the second type studies an adversary that is capable of polluting data an unbounded number of times. The paper establishes an upper bound on the resilience capacity for a locally repairable code. This paper also proves that the proposed concatenated coding approach attains the upper bound on the resilience capacity in the presence of the first type of adversary for both minimum storage regenerating codes and locally repairable codes. Further, this paper presents mechanisms that combine the presented concatenated coding scheme with subspace signatures to achieve error resilience for the second type of errors. |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-BBI GBV_ILN_65 GBV_ILN_70 GBV_ILN_2002 GBV_ILN_2088 GBV_ILN_4318 |
| container_issue |
11 |
| title_short |
Error-Correcting Regenerating and Locally Repairable Codes via Rank-Metric Codes |
| url |
http://dx.doi.org/10.1109/TIT.2015.2480848 http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=7273884 http://search.proquest.com/docview/1728001903 |
| remote_bool |
false |
| author2 |
Rawat, Ankit Singh Vishwanath, Sriram |
| author2Str |
Rawat, Ankit Singh Vishwanath, Sriram |
| ppnlink |
12954731X |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| author2_role |
oth oth |
| doi_str |
10.1109/TIT.2015.2480848 |
| up_date |
2024-07-04T06:47:36.425Z |
| _version_ |
1803630051513597952 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">OLC1963916670</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220221163256.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">160206s2015 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1109/TIT.2015.2480848</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20160617</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1963916670</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1963916670</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)c2091-69cc254fbcac577520d45eae256e15d8e1fa13f8d36deaaf0087dc2dd7b005960</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0023448620150000061001105765errorcorrectingregeneratingandlocallyrepairablecod</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">070</subfield><subfield code="a">620</subfield><subfield code="q">DNB</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SA 5570</subfield><subfield code="q">AVZ</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Silberstein, Natalia</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Error-Correcting Regenerating and Locally Repairable Codes via Rank-Metric Codes</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2015</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This paper presents and analyzes a novel concatenated coding scheme for enabling error resilience in two distributed storage settings: one being storage using existing regenerating codes and the second being storage using locally repairable codes. The concatenated coding scheme brings together a maximum rank distance code as an outer code and either a globally regenerating or a locally repairable code as an inner code. In addition, error resilience for combination of locally repairable codes with regenerating codes is considered. This concatenated coding system is designed to handle two different types of adversarial errors: the first type includes an adversary that can replace the content of an affected node only once; while the second type studies an adversary that is capable of polluting data an unbounded number of times. The paper establishes an upper bound on the resilience capacity for a locally repairable code. This paper also proves that the proposed concatenated coding approach attains the upper bound on the resilience capacity in the presence of the first type of adversary for both minimum storage regenerating codes and locally repairable codes. Further, this paper presents mechanisms that combine the presented concatenated coding scheme with subspace signatures to achieve error resilience for the second type of errors.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Resilience</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Coding for distributed storage systems</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Upper bound</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">rank-metric codes</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Encoding</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Decision support systems</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">locally repairable codes</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">error correcting codes</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">regenerating codes</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Arrays</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Bandwidth</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Maintenance engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Errors</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Codes</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Information theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Arrays (Data structures)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Error-correcting codes</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Analysis</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Usage</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Rawat, Ankit Singh</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Vishwanath, Sriram</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">IEEE transactions on information theory</subfield><subfield code="d">Piscataway, NJ : IEEE, 1963</subfield><subfield code="g">61(2015), 11, Seite 5765-5778</subfield><subfield code="w">(DE-627)12954731X</subfield><subfield code="w">(DE-600)218505-2</subfield><subfield code="w">(DE-576)01499819X</subfield><subfield code="x">0018-9448</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:61</subfield><subfield code="g">year:2015</subfield><subfield code="g">number:11</subfield><subfield code="g">pages:5765-5778</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://dx.doi.org/10.1109/TIT.2015.2480848</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=7273884</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://search.proquest.com/docview/1728001903</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-BUB</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-BBI</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2002</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="936" ind1="r" ind2="v"><subfield code="a">SA 5570</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">61</subfield><subfield code="j">2015</subfield><subfield code="e">11</subfield><subfield code="h">5765-5778</subfield></datafield></record></collection>
|
| score |
7.401867 |