{"id":"https://openalex.org/W1984341030","doi":"https://doi.org/10.1109/isit.2014.6875142","title":"Partial MDS (PMDS) and Sector-Disk (SD) codes that tolerate the erasure of two random sectors","display_name":"Partial MDS (PMDS) and Sector-Disk (SD) codes that tolerate the erasure of two random sectors","publication_year":2014,"publication_date":"2014-06-01","ids":{"openalex":"https://openalex.org/W1984341030","doi":"https://doi.org/10.1109/isit.2014.6875142","mag":"1984341030"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2014.6875142","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2014.6875142","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5003555864","display_name":"Mario Blaum","orcid":"https://orcid.org/0000-0002-5711-9411"},"institutions":[{"id":"https://openalex.org/I4210085935","display_name":"IBM Research - Almaden","ror":"https://ror.org/005w8dd04","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210085935","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mario Blaum","raw_affiliation_strings":["IBM Research Division, Almaden Research Center, San Jose, CA, USA","Almaden Research Center, IBM, San Jose, CA, USA"],"affiliations":[{"raw_affiliation_string":"IBM Research Division, Almaden Research Center, San Jose, CA, USA","institution_ids":["https://openalex.org/I4210085935"]},{"raw_affiliation_string":"Almaden Research Center, IBM, San Jose, CA, USA","institution_ids":["https://openalex.org/I4210085935"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051321089","display_name":"James S. Plank","orcid":"https://orcid.org/0000-0002-9841-6076"},"institutions":[{"id":"https://openalex.org/I75027704","display_name":"University of Tennessee at Knoxville","ror":"https://ror.org/020f3ap87","country_code":"US","type":"education","lineage":["https://openalex.org/I75027704"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"James S. Plank","raw_affiliation_strings":["Dept. of Electrical Engineering and Computer Science, Univ. of Tennessee, Knoxville, TN, USA","Dept. of Electr. Eng. & Comput. Sci., Univ. of Tennessee, Knoxville, TN, USA"],"affiliations":[{"raw_affiliation_string":"Dept. of Electrical Engineering and Computer Science, Univ. of Tennessee, Knoxville, TN, USA","institution_ids":["https://openalex.org/I75027704"]},{"raw_affiliation_string":"Dept. of Electr. Eng. & Comput. Sci., Univ. of Tennessee, Knoxville, TN, USA","institution_ids":["https://openalex.org/I75027704"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054043026","display_name":"Moshe Schwartz","orcid":"https://orcid.org/0000-0002-1449-0026"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Moshe Schwartz","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Ben-Gurion University, Beer Sheva, Israel","Dept. of Electr. & Comput. Eng., Ben-Gurion Univ., Beer Sheva, Israel"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Ben-Gurion University, Beer Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Ben-Gurion Univ., Beer Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021586372","display_name":"Eitan Yaakobi","orcid":"https://orcid.org/0000-0002-9851-5234"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Eitan Yaakobi","raw_affiliation_strings":["Computer Science Department, Technion - Israel Institute of Technology, Haifa, Israel","Computer Sci. Dept., Technion - Israel Inst. of Tech., Haifa, Israel#TAB#"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Technion - Israel Institute of Technology, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]},{"raw_affiliation_string":"Computer Sci. Dept., Technion - Israel Inst. of Tech., Haifa, Israel#TAB#","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5003555864"],"corresponding_institution_ids":["https://openalex.org/I4210085935"],"apc_list":null,"apc_paid":null,"fwci":4.3166,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.94495213,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1792","last_page":"1796"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9914000034332275,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/raid","display_name":"RAID","score":0.9262340068817139},{"id":"https://openalex.org/keywords/erasure-code","display_name":"Erasure code","score":0.6608733534812927},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6573270559310913},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.6468391418457031},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.4538589119911194},{"id":"https://openalex.org/keywords/tornado-code","display_name":"Tornado code","score":0.4296712279319763},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3231794238090515},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2557998299598694},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.23439723253250122},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.20372611284255981},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.17335322499275208},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1428411304950714},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.1289253532886505}],"concepts":[{"id":"https://openalex.org/C133320665","wikidata":"https://www.wikidata.org/wiki/Q179299","display_name":"RAID","level":2,"score":0.9262340068817139},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.6608733534812927},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6573270559310913},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.6468391418457031},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.4538589119911194},{"id":"https://openalex.org/C65058987","wikidata":"https://www.wikidata.org/wiki/Q7826005","display_name":"Tornado code","level":5,"score":0.4296712279319763},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3231794238090515},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2557998299598694},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.23439723253250122},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.20372611284255981},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.17335322499275208},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1428411304950714},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.1289253532886505}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2014.6875142","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2014.6875142","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.641.1501","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.641.1501","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ee.bgu.ac.il/~schwartz/publications/MSconf28.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.4699999988079071,"display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W154253821","https://openalex.org/W1483412554","https://openalex.org/W1606480398","https://openalex.org/W1767936930","https://openalex.org/W1960027378","https://openalex.org/W1995147907","https://openalex.org/W2060646539","https://openalex.org/W2076294573","https://openalex.org/W2114197496","https://openalex.org/W2124961791","https://openalex.org/W2144309254","https://openalex.org/W2595628957","https://openalex.org/W6606324823","https://openalex.org/W6628808325","https://openalex.org/W6640808514"],"related_works":["https://openalex.org/W1947697163","https://openalex.org/W2388345855","https://openalex.org/W4399767110","https://openalex.org/W4380993879","https://openalex.org/W2137028263","https://openalex.org/W2200161898","https://openalex.org/W2333324284","https://openalex.org/W2982181605","https://openalex.org/W22887618","https://openalex.org/W2744779861"],"abstract_inverted_index":{"Partial":[0],"MDS":[1],"(PMDS)":[2],"codes":[3,6,20,23,43],"are":[4,21],"erasure":[5,22],"combining":[7],"local":[8],"(row)":[9],"correction":[10,14],"with":[11],"global":[12],"additional":[13],"of":[15,30,72,75],"entries,":[16],"while":[17],"Sector-Disk":[18],"(SD)":[19],"that":[24,44,68],"address":[25],"the":[26,46,49,70],"mixed":[27],"failure":[28],"mode":[29],"current":[31],"RAID":[32,97,100],"systems.":[33],"It":[34],"has":[35,55],"been":[36],"an":[37],"open":[38],"problem":[39],"to":[40],"construct":[41],"general":[42,66],"have":[45],"PMDS":[47],"and":[48,52,78,99],"SD":[50],"properties,":[51],"previous":[53,94],"work":[54],"relied":[56],"on":[57],"Monte-Carlo":[58],"searches.":[59],"In":[60],"this":[61],"paper,":[62],"we":[63],"present":[64],"a":[65,87],"construction":[67,85],"addresses":[69],"case":[71],"any":[73],"number":[74],"failed":[76],"disks":[77],"in":[79],"addition,":[80],"two":[81],"erased":[82],"sectors.":[83],"The":[84],"requires":[86],"modest":[88],"field":[89],"size.":[90],"This":[91],"result":[92],"generalizes":[93],"constructions":[95],"extending":[96],"5":[98],"6.":[101]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}