{"id":"https://openalex.org/W4386066369","doi":"https://doi.org/10.1109/isit54713.2023.10206840","title":"On a Class of Optimal Locally Recoverable Codes with Availability","display_name":"On a Class of Optimal Locally Recoverable Codes with Availability","publication_year":2023,"publication_date":"2023-06-25","ids":{"openalex":"https://openalex.org/W4386066369","doi":"https://doi.org/10.1109/isit54713.2023.10206840"},"language":"en","primary_location":{"id":"doi:10.1109/isit54713.2023.10206840","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit54713.2023.10206840","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/A5092674647","display_name":"Clifton Garrison","orcid":null},"institutions":[{"id":"https://openalex.org/I2613432","display_name":"University of South Florida","ror":"https://ror.org/032db5x82","country_code":"US","type":"education","lineage":["https://openalex.org/I2613432"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Clifton Garrison","raw_affiliation_strings":["University of South Florida,Tampa,33620"],"affiliations":[{"raw_affiliation_string":"University of South Florida,Tampa,33620","institution_ids":["https://openalex.org/I2613432"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050777736","display_name":"Giacomo Micheli","orcid":"https://orcid.org/0000-0002-5265-5207"},"institutions":[{"id":"https://openalex.org/I2613432","display_name":"University of South Florida","ror":"https://ror.org/032db5x82","country_code":"US","type":"education","lineage":["https://openalex.org/I2613432"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Giacomo Micheli","raw_affiliation_strings":["University of South Florida,Tampa,33620"],"affiliations":[{"raw_affiliation_string":"University of South Florida,Tampa,33620","institution_ids":["https://openalex.org/I2613432"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5092674648","display_name":"Logan Nott","orcid":null},"institutions":[{"id":"https://openalex.org/I2613432","display_name":"University of South Florida","ror":"https://ror.org/032db5x82","country_code":"US","type":"education","lineage":["https://openalex.org/I2613432"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Logan Nott","raw_affiliation_strings":["University of South Florida,Tampa,33620"],"affiliations":[{"raw_affiliation_string":"University of South Florida,Tampa,33620","institution_ids":["https://openalex.org/I2613432"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010029041","display_name":"Vincenzo Pallozzi Lavorante","orcid":"https://orcid.org/0000-0002-8725-5473"},"institutions":[{"id":"https://openalex.org/I2613432","display_name":"University of South Florida","ror":"https://ror.org/032db5x82","country_code":"US","type":"education","lineage":["https://openalex.org/I2613432"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vincenzo Pallozzi Lavorante","raw_affiliation_strings":["University of South Florida,Tampa,33620"],"affiliations":[{"raw_affiliation_string":"University of South Florida,Tampa,33620","institution_ids":["https://openalex.org/I2613432"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5092674649","display_name":"Phillip Waitkevich","orcid":null},"institutions":[{"id":"https://openalex.org/I2613432","display_name":"University of South Florida","ror":"https://ror.org/032db5x82","country_code":"US","type":"education","lineage":["https://openalex.org/I2613432"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Phillip Waitkevich","raw_affiliation_strings":["University of South Florida,Tampa,33620"],"affiliations":[{"raw_affiliation_string":"University of South Florida,Tampa,33620","institution_ids":["https://openalex.org/I2613432"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5092674647"],"corresponding_institution_ids":["https://openalex.org/I2613432"],"apc_list":null,"apc_paid":null,"fwci":0.6027,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.68205764,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"2021","last_page":"2026"},"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/T12162","display_name":"Cellular Automata and Applications","score":0.9811000227928162,"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"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9800000190734863,"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/locality","display_name":"Locality","score":0.6982752084732056},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.6844813823699951},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6431143879890442},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6369011402130127},{"id":"https://openalex.org/keywords/singleton","display_name":"Singleton","score":0.6361123323440552},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.624207615852356},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5824692249298096},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5218926072120667},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.506353497505188},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4563103914260864},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2911894917488098},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.16858071088790894},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.1534917652606964},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.11371424794197083}],"concepts":[{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.6982752084732056},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.6844813823699951},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6431143879890442},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6369011402130127},{"id":"https://openalex.org/C117354338","wikidata":"https://www.wikidata.org/wiki/Q1165112","display_name":"Singleton","level":3,"score":0.6361123323440552},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.624207615852356},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5824692249298096},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5218926072120667},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.506353497505188},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4563103914260864},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2911894917488098},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.16858071088790894},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.1534917652606964},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.11371424794197083},{"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C2779234561","wikidata":"https://www.wikidata.org/wiki/Q11995","display_name":"Pregnancy","level":2,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit54713.2023.10206840","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit54713.2023.10206840","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":37,"referenced_works":["https://openalex.org/W1778950143","https://openalex.org/W1993830711","https://openalex.org/W1997044393","https://openalex.org/W2021662392","https://openalex.org/W2022619326","https://openalex.org/W2050500290","https://openalex.org/W2058863419","https://openalex.org/W2105185344","https://openalex.org/W2120770247","https://openalex.org/W2150777202","https://openalex.org/W2155418912","https://openalex.org/W2339524574","https://openalex.org/W2394741319","https://openalex.org/W2582551733","https://openalex.org/W2623918255","https://openalex.org/W2963059679","https://openalex.org/W2963577423","https://openalex.org/W2963591684","https://openalex.org/W2963963730","https://openalex.org/W2966044853","https://openalex.org/W2978757494","https://openalex.org/W3004673800","https://openalex.org/W3005745831","https://openalex.org/W3027316775","https://openalex.org/W3100004208","https://openalex.org/W3100282565","https://openalex.org/W3104144315","https://openalex.org/W3105083253","https://openalex.org/W3106482607","https://openalex.org/W3139628486","https://openalex.org/W4255555394","https://openalex.org/W4289713107","https://openalex.org/W4292937362","https://openalex.org/W6753140384","https://openalex.org/W6785086341","https://openalex.org/W6786357862","https://openalex.org/W6841940116"],"related_works":["https://openalex.org/W747331120","https://openalex.org/W2351588585","https://openalex.org/W4233660055","https://openalex.org/W2076370897","https://openalex.org/W2906951486","https://openalex.org/W3125437892","https://openalex.org/W2895235410","https://openalex.org/W3087644915","https://openalex.org/W251429526","https://openalex.org/W2304380675"],"abstract_inverted_index":{"An":[0],"[n,":[1],"k,":[2,15,133],"d,":[3,20,135],"r]":[4],"Locally":[5,82],"Recoverable":[6,83],"Code":[7],"(LRC)":[8],"is":[9,27,109],"a":[10,34,42,50,167],"linear":[11],"code":[12],"of":[13,31,33,53,74,101,130,146,175,188],"dimension":[14],"length":[16],"n,":[17,132],"minimum":[18,29],"distance":[19,116],"and":[21],"locality":[22,26],"r,":[23,134],"where":[24],"the":[25,28,77,112,115,124,144,156,173,186],"number":[30],"coordinates":[32],"codeword":[35],"one":[36],"has":[37,64],"to":[38,180],"access":[39],"when":[40],"recovering":[41],"single":[43],"erasure.":[44],"In":[45],"this":[46,108],"paper":[47],"we":[48],"construct":[49],"new":[51,168],"family":[52],"optimal":[54],"locally":[55],"recoverable":[56],"codes":[57,147],"with":[58,138,148],"availability":[59,100,121,149],"t,":[60,136],"i.e.":[61,85],"any":[62],"node":[63],"t":[65,139,150],"distinct":[66],"recovery":[67],"sets.":[68],"Our":[69,163],"codes,":[70],"for":[71,81,114,159],"some":[72],"sets":[73],"parameters,":[75],"achieve":[76],"generalized":[78],"Singleton":[79,125,157],"bound":[80,126,158],"Codes,":[84],"$d":[86],"\\leq":[87],"n":[88],"-":[89,91],"k":[90],"\\left\\lceil":[92],"{\\frac{k}{r}}":[93],"\\right\\rceil":[94],"+":[95],"2$,":[96],"while":[97],"still":[98,154],"allowing":[99],"nodes.":[102],"From":[103],"an":[104],"information":[105],"theoretical":[106],"perspective,":[107],"possible":[110],"because":[111],"inequalities":[113],"that":[117,153,178],"take":[118],"into":[119],"account":[120],"simply":[122],"return":[123],"in":[127],"certain":[128],"regimes":[129],"parameters":[131],"even":[137],"\u2265":[140,151],"2.":[141],"This":[142],"allows":[143,179],"existence":[145],"2":[152],"match":[155],"LRCs":[160],"mentioned":[161],"earlier.":[162],"construction":[164],"relies":[165],"on":[166],"combinatorial":[169],"structure,":[170],"arising":[171],"from":[172],"theory":[174],"finite":[176],"fields,":[177],"produce":[181],"orthogonal":[182],"partitions":[183],"by":[184],"leveraging":[185],"arithmetic":[187],"polynomial":[189],"rings.":[190]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}