{"id":"https://openalex.org/W2165339489","doi":"https://doi.org/10.1145/2700308","title":"Low-Complexity Implementation of RAID Based on Reed-Solomon Codes","display_name":"Low-Complexity Implementation of RAID Based on Reed-Solomon Codes","publication_year":2015,"publication_date":"2015-02-24","ids":{"openalex":"https://openalex.org/W2165339489","doi":"https://doi.org/10.1145/2700308","mag":"2165339489"},"language":"en","primary_location":{"id":"doi:10.1145/2700308","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2700308","pdf_url":null,"source":{"id":"https://openalex.org/S158124317","display_name":"ACM Transactions on Storage","issn_l":"1553-3077","issn":["1553-3077","1553-3093"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Storage","raw_type":"journal-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/A5016322127","display_name":"Peter Trifonov","orcid":"https://orcid.org/0000-0001-6960-0942"},"institutions":[{"id":"https://openalex.org/I212220629","display_name":"Peter the Great St. Petersburg Polytechnic University","ror":"https://ror.org/02x91aj62","country_code":"RU","type":"education","lineage":["https://openalex.org/I212220629"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"P. Trifonov","raw_affiliation_strings":["Saint-Petersburg State Polytechnic University, Saint-Petersburg, Russia"],"affiliations":[{"raw_affiliation_string":"Saint-Petersburg State Polytechnic University, Saint-Petersburg, Russia","institution_ids":["https://openalex.org/I212220629"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5016322127"],"corresponding_institution_ids":["https://openalex.org/I212220629"],"apc_list":null,"apc_paid":null,"fwci":2.6626,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.91124168,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"11","issue":"1","first_page":"1","last_page":"25"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9998999834060669,"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":0.9998999834060669,"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/T11130","display_name":"Coding theory and cryptography","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12162","display_name":"Cellular Automata and Applications","score":0.9918000102043152,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/computer-science","display_name":"Computer science","score":0.880856990814209},{"id":"https://openalex.org/keywords/raid","display_name":"RAID","score":0.8083990812301636},{"id":"https://openalex.org/keywords/reed\u2013solomon-error-correction","display_name":"Reed\u2013Solomon error correction","score":0.6844712495803833},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5608174204826355},{"id":"https://openalex.org/keywords/galois-theory","display_name":"Galois theory","score":0.5597763061523438},{"id":"https://openalex.org/keywords/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.4814164340496063},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.47363701462745667},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.46829715371131897},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.4228402078151703},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3229222595691681},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.21601718664169312},{"id":"https://openalex.org/keywords/computer-hardware","display_name":"Computer hardware","score":0.18642768263816833},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.16647058725357056},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.11459037661552429},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.0976192057132721},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07534188032150269},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.07132858037948608}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.880856990814209},{"id":"https://openalex.org/C133320665","wikidata":"https://www.wikidata.org/wiki/Q179299","display_name":"RAID","level":2,"score":0.8083990812301636},{"id":"https://openalex.org/C78065487","wikidata":"https://www.wikidata.org/wiki/Q1061598","display_name":"Reed\u2013Solomon error correction","level":5,"score":0.6844712495803833},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5608174204826355},{"id":"https://openalex.org/C94398972","wikidata":"https://www.wikidata.org/wiki/Q92552","display_name":"Galois theory","level":2,"score":0.5597763061523438},{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.4814164340496063},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.47363701462745667},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.46829715371131897},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.4228402078151703},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3229222595691681},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.21601718664169312},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","level":1,"score":0.18642768263816833},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.16647058725357056},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.11459037661552429},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0976192057132721},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07534188032150269},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.07132858037948608},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2700308","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2700308","pdf_url":null,"source":{"id":"https://openalex.org/S158124317","display_name":"ACM Transactions on Storage","issn_l":"1553-3077","issn":["1553-3077","1553-3093"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Storage","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W2757614","https://openalex.org/W58580312","https://openalex.org/W595895948","https://openalex.org/W947704800","https://openalex.org/W1471103927","https://openalex.org/W1528935082","https://openalex.org/W1537045696","https://openalex.org/W1593683169","https://openalex.org/W1606480398","https://openalex.org/W1622719107","https://openalex.org/W1668135028","https://openalex.org/W1796097737","https://openalex.org/W1974401809","https://openalex.org/W1980822076","https://openalex.org/W1986504082","https://openalex.org/W1992406028","https://openalex.org/W2008285919","https://openalex.org/W2030571394","https://openalex.org/W2039206224","https://openalex.org/W2040647299","https://openalex.org/W2045548620","https://openalex.org/W2065465262","https://openalex.org/W2095954064","https://openalex.org/W2099837838","https://openalex.org/W2114813128","https://openalex.org/W2124312471","https://openalex.org/W2137291643","https://openalex.org/W2141222886","https://openalex.org/W2143081204","https://openalex.org/W2145170726","https://openalex.org/W2146868478","https://openalex.org/W2147343704","https://openalex.org/W2152096493","https://openalex.org/W2159416784","https://openalex.org/W2165015993","https://openalex.org/W2169603504","https://openalex.org/W2589435118","https://openalex.org/W2613956024","https://openalex.org/W2752061190","https://openalex.org/W2752853835","https://openalex.org/W2912574597","https://openalex.org/W3100826625","https://openalex.org/W4233038736","https://openalex.org/W4252771394","https://openalex.org/W4285719527","https://openalex.org/W4376544923","https://openalex.org/W6948265142"],"related_works":["https://openalex.org/W2067127569","https://openalex.org/W844466527","https://openalex.org/W2538383631","https://openalex.org/W2081191264","https://openalex.org/W3175040360","https://openalex.org/W2186735402","https://openalex.org/W1964283646","https://openalex.org/W2363989907","https://openalex.org/W1993556010","https://openalex.org/W2165339489"],"abstract_inverted_index":{"Fast":[0],"algorithms":[1,46,62,72],"are":[2],"proposed":[3,16,61],"for":[4,52],"encoding":[5],"and":[6,27],"reconstructing":[7],"data":[8],"in":[9],"RAID":[10],"based":[11,19],"on":[12,20],"Reed-Solomon":[13],"codes.":[14,56],"The":[15,41,65],"approach":[17],"is":[18,47,63],"the":[21,33,44,60,70,79],"cyclotomic":[22],"fast":[23],"Fourier":[24],"transform":[25],"algorithm":[26],"enables":[28],"one":[29],"to":[30],"significantly":[31],"reduce":[32],"number":[34],"of":[35,43,59],"expensive":[36],"Galois":[37],"field":[38],"multiplications":[39],"required.":[40],"complexity":[42],"obtained":[45],"much":[48],"lower":[49],"than":[50],"those":[51],"existing":[53],"MDS":[54],"array":[55],"Software":[57],"implementation":[58],"discussed.":[64],"performance":[66,76],"results":[67],"show":[68],"that":[69],"new":[71],"provide":[73],"substantially":[74],"better":[75],"compared":[77],"with":[78],"standard":[80],"algorithm.":[81]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
