{"id":"https://openalex.org/W3037821811","doi":"https://doi.org/10.1109/lcomm.2020.3004757","title":"A Class of Codes With Availability and Multiple Local-Erasures Correction","display_name":"A Class of Codes With Availability and Multiple Local-Erasures Correction","publication_year":2020,"publication_date":"2020-06-24","ids":{"openalex":"https://openalex.org/W3037821811","doi":"https://doi.org/10.1109/lcomm.2020.3004757","mag":"3037821811"},"language":"en","primary_location":{"id":"doi:10.1109/lcomm.2020.3004757","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcomm.2020.3004757","pdf_url":null,"source":{"id":"https://openalex.org/S147316732","display_name":"IEEE Communications Letters","issn_l":"1089-7798","issn":["1089-7798","1558-2558","2373-7891"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Communications Letters","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/A5031628419","display_name":"Ujwal Deep Kadiyam","orcid":"https://orcid.org/0000-0003-0624-3751"},"institutions":[{"id":"https://openalex.org/I1317621060","display_name":"Indian Institute of Technology Guwahati","ror":"https://ror.org/0022nd079","country_code":"IN","type":"education","lineage":["https://openalex.org/I1317621060"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Ujwal Deep Kadiyam","raw_affiliation_strings":["IIT Guwahati, Guwahati, India"],"affiliations":[{"raw_affiliation_string":"IIT Guwahati, Guwahati, India","institution_ids":["https://openalex.org/I1317621060"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101810218","display_name":"Smarajit Das","orcid":"https://orcid.org/0000-0001-6260-6129"},"institutions":[{"id":"https://openalex.org/I1317621060","display_name":"Indian Institute of Technology Guwahati","ror":"https://ror.org/0022nd079","country_code":"IN","type":"education","lineage":["https://openalex.org/I1317621060"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Smarajit Das","raw_affiliation_strings":["IIT Guwahati, Guwahati, India"],"affiliations":[{"raw_affiliation_string":"IIT Guwahati, Guwahati, India","institution_ids":["https://openalex.org/I1317621060"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5031628419"],"corresponding_institution_ids":["https://openalex.org/I1317621060"],"apc_list":null,"apc_paid":null,"fwci":0.3084,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.60008728,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"24","issue":"10","first_page":"2087","last_page":"2091"},"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.9833999872207642,"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/T11478","display_name":"Caching and Content Delivery","score":0.9825000166893005,"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/disjoint-sets","display_name":"Disjoint sets","score":0.7575711011886597},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.6951464414596558},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.6682299971580505},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.6495933532714844},{"id":"https://openalex.org/keywords/symbol","display_name":"Symbol (formal)","score":0.639116644859314},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5883709192276001},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5799857378005981},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5411607027053833},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5390218496322632},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5376163125038147},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4861747622489929},{"id":"https://openalex.org/keywords/locality","display_name":"Locality","score":0.4361308813095093},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3921688199043274},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.383872926235199},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.3337407112121582},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31215885281562805},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.1437913179397583},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09036526083946228}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7575711011886597},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.6951464414596558},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.6682299971580505},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.6495933532714844},{"id":"https://openalex.org/C134400042","wikidata":"https://www.wikidata.org/wiki/Q2372244","display_name":"Symbol (formal)","level":2,"score":0.639116644859314},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5883709192276001},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5799857378005981},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5411607027053833},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5390218496322632},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5376163125038147},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4861747622489929},{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.4361308813095093},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3921688199043274},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.383872926235199},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3337407112121582},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31215885281562805},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.1437913179397583},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09036526083946228},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lcomm.2020.3004757","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcomm.2020.3004757","pdf_url":null,"source":{"id":"https://openalex.org/S147316732","display_name":"IEEE Communications Letters","issn_l":"1089-7798","issn":["1089-7798","1558-2558","2373-7891"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Communications Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1993830711","https://openalex.org/W1996042140","https://openalex.org/W2069554151","https://openalex.org/W2275609782","https://openalex.org/W2599640732","https://openalex.org/W2767162247","https://openalex.org/W2963063105"],"related_works":["https://openalex.org/W2943247777","https://openalex.org/W2740543340","https://openalex.org/W2371167013","https://openalex.org/W1582340598","https://openalex.org/W1541021634","https://openalex.org/W2779867339","https://openalex.org/W2794545997","https://openalex.org/W2584980534","https://openalex.org/W2182731056","https://openalex.org/W66917582"],"abstract_inverted_index":{"In":[0,23,36],"a":[1,20,41,75],"locally":[2],"recoverable":[3],"code":[4,7,77],"(LRC),":[5],"any":[6,28,64],"symbol":[8,30,66],"can":[9],"be":[10],"recovered":[11],"by":[12,74],"accessing":[13],"at":[14,82],"most":[15],"r":[16],"other":[17],"symbols":[18],"(called":[19],"recovery":[21,34,61],"set).":[22],"an":[24,91],"LRC":[25],"with":[26,46,106,114],"availability,":[27,47],"information":[29,65,107],"has":[31,67],"t":[32,59],"disjoint":[33,60],"sets.":[35],"this":[37],"letter,":[38],"we":[39],"consider":[40],"new":[42],"class":[43],"of":[44,78,98,103],"codes":[45,105],"where":[48],"the":[49,94,112],"l":[50,57],"<sup":[51],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[52,86],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">th</sup>":[53],",":[54],"1":[55],"\u2264":[56,58],"set":[62],"for":[63],"locality":[68],"rl":[69],"and":[70],"it":[71],"is":[72,109],"protected":[73],"local":[76],"minimum":[79,95],"Hamming":[80,96],"distance":[81,97],"least":[83],"\u03b4":[84],"<sub":[85],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">l</sub>":[87],".":[88],"We":[89],"derive":[90],"upper-bound":[92],"on":[93],"these":[99],"codes.":[100],"A":[101],"family":[102],"systematic":[104],"availability":[108],"constructed":[110],"achieving":[111],"bound":[113],"equality.":[115]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}