{"id":"https://openalex.org/W4386075142","doi":"https://doi.org/10.1109/isit54713.2023.10206491","title":"Designing Compact Repair Groups for Reed-Solomon Codes","display_name":"Designing Compact Repair Groups for Reed-Solomon Codes","publication_year":2023,"publication_date":"2023-06-25","ids":{"openalex":"https://openalex.org/W4386075142","doi":"https://doi.org/10.1109/isit54713.2023.10206491"},"language":"en","primary_location":{"id":"doi:10.1109/isit54713.2023.10206491","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit54713.2023.10206491","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE International Symposium on Information Theory (ISIT)","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/A5016266355","display_name":"Thi Xinh Dinh","orcid":"https://orcid.org/0000-0002-7098-1073"},"institutions":[{"id":"https://openalex.org/I4387154951","display_name":"Tay Nguyen University","ror":"https://ror.org/01s7bde64","country_code":null,"type":"education","lineage":["https://openalex.org/I4387154951"]},{"id":"https://openalex.org/I4210115718","display_name":"Thai Nguyen University","ror":"https://ror.org/02128gy91","country_code":"VN","type":"education","lineage":["https://openalex.org/I4210115718"]},{"id":"https://openalex.org/I82951845","display_name":"RMIT University","ror":"https://ror.org/04ttjf776","country_code":"AU","type":"education","lineage":["https://openalex.org/I82951845"]}],"countries":["AU","VN"],"is_corresponding":true,"raw_author_name":"Thi Xinh Dinh","raw_affiliation_strings":["RMIT University,Melbourne,Australia,VIC 3000","Tay Nguyen University, Vietnam"],"affiliations":[{"raw_affiliation_string":"RMIT University,Melbourne,Australia,VIC 3000","institution_ids":["https://openalex.org/I82951845"]},{"raw_affiliation_string":"Tay Nguyen University, Vietnam","institution_ids":["https://openalex.org/I4210115718","https://openalex.org/I4387154951"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087280399","display_name":"Serdar Bozta\u015f","orcid":"https://orcid.org/0000-0001-6724-4366"},"institutions":[{"id":"https://openalex.org/I82951845","display_name":"RMIT University","ror":"https://ror.org/04ttjf776","country_code":"AU","type":"education","lineage":["https://openalex.org/I82951845"]},{"id":"https://openalex.org/I4210125903","display_name":"University Research Co (United States)","ror":"https://ror.org/02tbz8k15","country_code":"US","type":"company","lineage":["https://openalex.org/I4210125903"]}],"countries":["AU","US"],"is_corresponding":false,"raw_author_name":"Serdar Boztas","raw_affiliation_strings":["RMIT University,Melbourne,Australia,VIC 3000","University Research Foundation, Greenbelt, USA"],"affiliations":[{"raw_affiliation_string":"RMIT University,Melbourne,Australia,VIC 3000","institution_ids":["https://openalex.org/I82951845"]},{"raw_affiliation_string":"University Research Foundation, Greenbelt, USA","institution_ids":["https://openalex.org/I4210125903"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031318960","display_name":"Son Hoang Dau","orcid":"https://orcid.org/0000-0002-2276-017X"},"institutions":[{"id":"https://openalex.org/I82951845","display_name":"RMIT University","ror":"https://ror.org/04ttjf776","country_code":"AU","type":"education","lineage":["https://openalex.org/I82951845"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Son Hoang Dau","raw_affiliation_strings":["RMIT University,Melbourne,Australia,VIC 3000"],"affiliations":[{"raw_affiliation_string":"RMIT University,Melbourne,Australia,VIC 3000","institution_ids":["https://openalex.org/I82951845"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043667125","display_name":"Emanuele Viterbo","orcid":"https://orcid.org/0000-0002-5861-2873"},"institutions":[{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Emanuele Viterbo","raw_affiliation_strings":["Monash University,Clayton,Australia,VIC 3800"],"affiliations":[{"raw_affiliation_string":"Monash University,Clayton,Australia,VIC 3800","institution_ids":["https://openalex.org/I56590836"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5016266355"],"corresponding_institution_ids":["https://openalex.org/I4210115718","https://openalex.org/I4387154951","https://openalex.org/I82951845"],"apc_list":null,"apc_paid":null,"fwci":0.6019,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.6821941,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"2027","last_page":"2032"},"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.9922000169754028,"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/T10237","display_name":"Cryptography and Data Security","score":0.9872000217437744,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/linear-subspace","display_name":"Linear subspace","score":0.7582122683525085},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5973473191261292},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5897239446640015},{"id":"https://openalex.org/keywords/subspace-topology","display_name":"Subspace topology","score":0.5767091512680054},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5371310114860535},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4589989185333252},{"id":"https://openalex.org/keywords/compact-space","display_name":"Compact space","score":0.4491448700428009},{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.4319711923599243},{"id":"https://openalex.org/keywords/combinatorial-design","display_name":"Combinatorial design","score":0.416598916053772},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3809739351272583},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2979941964149475},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.17247557640075684},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07450833916664124}],"concepts":[{"id":"https://openalex.org/C12362212","wikidata":"https://www.wikidata.org/wiki/Q728435","display_name":"Linear subspace","level":2,"score":0.7582122683525085},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5973473191261292},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5897239446640015},{"id":"https://openalex.org/C32834561","wikidata":"https://www.wikidata.org/wiki/Q660730","display_name":"Subspace topology","level":2,"score":0.5767091512680054},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5371310114860535},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4589989185333252},{"id":"https://openalex.org/C18648836","wikidata":"https://www.wikidata.org/wiki/Q381892","display_name":"Compact space","level":2,"score":0.4491448700428009},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.4319711923599243},{"id":"https://openalex.org/C122451846","wikidata":"https://www.wikidata.org/wiki/Q5150824","display_name":"Combinatorial design","level":2,"score":0.416598916053772},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3809739351272583},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2979941964149475},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.17247557640075684},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07450833916664124},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C46757340","wikidata":"https://www.wikidata.org/wiki/Q43238","display_name":"Poaceae","level":2,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit54713.2023.10206491","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit54713.2023.10206491","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W41204052","https://openalex.org/W957890732","https://openalex.org/W1606480398","https://openalex.org/W2057182494","https://openalex.org/W2059453880","https://openalex.org/W2069984009","https://openalex.org/W2105185344","https://openalex.org/W2143996311","https://openalex.org/W2613593521","https://openalex.org/W2898024058","https://openalex.org/W2902882503","https://openalex.org/W2950353718","https://openalex.org/W2963072024","https://openalex.org/W2963151010","https://openalex.org/W2963487929","https://openalex.org/W2963677325","https://openalex.org/W2964223061","https://openalex.org/W3105184929","https://openalex.org/W3155022315","https://openalex.org/W3198305016","https://openalex.org/W4289713244","https://openalex.org/W4292027170","https://openalex.org/W6601658435"],"related_works":["https://openalex.org/W2041031851","https://openalex.org/W2951688395","https://openalex.org/W1985684185","https://openalex.org/W2138272128","https://openalex.org/W3136799639","https://openalex.org/W2072697976","https://openalex.org/W2612178525","https://openalex.org/W2955437458","https://openalex.org/W3081370402","https://openalex.org/W4287686225"],"abstract_inverted_index":{"Motivated":[0],"by":[1],"the":[2,20,39,63,93,106,119,127,152,164,177,181,187],"application":[3],"of":[4,22,44,47,96,100,108,113,116,118,143,154,172],"Reed-Solomon":[5],"codes":[6],"to":[7,76],"recently":[8],"emerging":[9],"decentralized":[10,33],"storage":[11],"systems":[12],"such":[13,155],"as":[14,84,87],"Storj":[15],"and":[16,65,70,148,163],"Filebase/Sia,":[17],"we":[18,139,168],"study":[19],"problem":[21],"designing":[23],"compact":[24,78],"repair":[25,42,59,79,101,128,188],"groups":[26,46,80,102,129,189],"for":[27,68,130],"recovering":[28],"multiple":[29,193],"failures":[30,86,97],"in":[31],"a":[32,53,56,98,109,114,136,141,156,170],"manner.":[34],"Here,":[35],"compactness":[36],"means":[37],"that":[38,81,92,174],"corresponding":[40],"trace":[41],"schemes":[43],"these":[45],"helpers":[48],"can":[49,82,103],"be":[50],"generated":[51,134,191],"from":[52,135,192],"single":[54,137],"or":[55],"few":[57],"seed":[58],"schemes,":[60],"thus":[61],"saving":[62],"time":[64],"space":[66],"required":[67],"finding":[69],"storing":[71],"them.":[72],"The":[73],"goal":[74],"is":[75],"design":[77],"tolerate":[83,104],"many":[85],"possible.":[88],"It":[89],"turns":[90],"out":[91],"maximum":[94],"number":[95,171],"collection":[99,115],"equals":[105],"size":[107,153,185],"minimum":[110,157,182],"hitting":[111,158,183],"set":[112,184],"subsets":[117],"finite":[120],"field":[121],"${\\mathbb{F}_{{q^\\ell":[122],"}}}$":[123],"minus":[124],"one.":[125],"When":[126],"each":[131],"symbol":[132],"are":[133,190],"subspace,":[138],"establish":[140],"pair":[142],"asymptotically":[144],"tight":[145],"lower":[146],"bound":[147,150,179],"upper":[149,178],"on":[151,180],"set.":[159],"Using":[160],"Burnside\u2019s":[161],"Lemma":[162],"M\u00f6bius":[165],"inversion":[166],"formula,":[167],"determine":[169],"subspaces":[173],"together":[175],"attain":[176],"when":[186],"subspaces.":[194]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}