{"id":"https://openalex.org/W2946879044","doi":"https://doi.org/10.1109/spcom.2018.8724452","title":"Locality and Availability with Multiple Erasure Correction","display_name":"Locality and Availability with Multiple Erasure Correction","publication_year":2018,"publication_date":"2018-07-01","ids":{"openalex":"https://openalex.org/W2946879044","doi":"https://doi.org/10.1109/spcom.2018.8724452","mag":"2946879044"},"language":"en","primary_location":{"id":"doi:10.1109/spcom.2018.8724452","is_oa":false,"landing_page_url":"https://doi.org/10.1109/spcom.2018.8724452","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 International Conference on Signal Processing and Communications (SPCOM)","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/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":["Department of Electrical and Electronics Engineering, Indian Institute of Technology, Guwahati"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Electronics Engineering, Indian Institute of Technology, Guwahati","institution_ids":["https://openalex.org/I1317621060"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5031628419"],"corresponding_institution_ids":["https://openalex.org/I1317621060"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.26452329,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"16","last_page":"20"},"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/T11478","display_name":"Caching and Content Delivery","score":0.9797000288963318,"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.975600004196167,"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/disjoint-sets","display_name":"Disjoint sets","score":0.767458438873291},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.7338033318519592},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.7086805701255798},{"id":"https://openalex.org/keywords/locality","display_name":"Locality","score":0.6356720328330994},{"id":"https://openalex.org/keywords/online-codes","display_name":"Online codes","score":0.5493176579475403},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.49794840812683105},{"id":"https://openalex.org/keywords/hamming","display_name":"Hamming(7,4)","score":0.49175265431404114},{"id":"https://openalex.org/keywords/erasure-code","display_name":"Erasure code","score":0.49027708172798157},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47013431787490845},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44925153255462646},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4315832555294037},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.42569079995155334},{"id":"https://openalex.org/keywords/huffman-coding","display_name":"Huffman coding","score":0.418423056602478},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.36220085620880127},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3411065340042114},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33735233545303345},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3318036198616028},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.14883911609649658},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.13365641236305237}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.767458438873291},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.7338033318519592},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.7086805701255798},{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.6356720328330994},{"id":"https://openalex.org/C103093684","wikidata":"https://www.wikidata.org/wiki/Q7094069","display_name":"Online codes","level":5,"score":0.5493176579475403},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.49794840812683105},{"id":"https://openalex.org/C112932734","wikidata":"https://www.wikidata.org/wiki/Q2322550","display_name":"Hamming(7,4)","level":5,"score":0.49175265431404114},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.49027708172798157},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47013431787490845},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44925153255462646},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4315832555294037},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.42569079995155334},{"id":"https://openalex.org/C46900642","wikidata":"https://www.wikidata.org/wiki/Q2647","display_name":"Huffman coding","level":3,"score":0.418423056602478},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36220085620880127},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3411065340042114},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33735233545303345},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3318036198616028},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.14883911609649658},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.13365641236305237},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"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/spcom.2018.8724452","is_oa":false,"landing_page_url":"https://doi.org/10.1109/spcom.2018.8724452","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 International Conference on Signal Processing and Communications (SPCOM)","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":14,"referenced_works":["https://openalex.org/W154253821","https://openalex.org/W1715633553","https://openalex.org/W1957362188","https://openalex.org/W1968528796","https://openalex.org/W1993830711","https://openalex.org/W1997044393","https://openalex.org/W2069554151","https://openalex.org/W2099837838","https://openalex.org/W2275609782","https://openalex.org/W2743675126","https://openalex.org/W2963063105","https://openalex.org/W3100004208","https://openalex.org/W6606324823","https://openalex.org/W6694437697"],"related_works":["https://openalex.org/W2008960744","https://openalex.org/W2173495775","https://openalex.org/W2355896184","https://openalex.org/W2381476312","https://openalex.org/W2744779861","https://openalex.org/W2364868136","https://openalex.org/W1557234699","https://openalex.org/W2153423941","https://openalex.org/W2157753730","https://openalex.org/W2946879044"],"abstract_inverted_index":{"Locally":[0],"Recoverable":[1],"Codes":[2,77],"(LRC)":[3],"that":[4,125,143],"can":[5,33,55,80,130,146],"correct":[6,83],"one":[7],"or":[8],"more":[9],"erasures":[10,85],"in":[11,74,86],"each":[12,24,60,108],"local":[13,88,134],"group":[14],"exist.":[15],"An":[16],"LRC":[17],"is":[18,94],"said":[19],"to":[20],"have":[21,56],"availability":[22,73,79],"if":[23],"symbol":[25,32,110],"has":[26],"disjoint":[27,40,52,104,127],"recovery":[28],"sets":[29],"and":[30,43,111],"the":[31,39,91,116],"be":[34,131,147],"recovered":[35],"from":[36],"any":[37],"of":[38,120,136],"sets.":[41],"Tamo":[42],"Barg":[44],"constructed":[45,148],"optimal":[46,144],"codes":[47,71,98,135,145],"with":[48,72,78,99],"availability,":[49],"but":[50],"different":[51,57,100,103,126,137],"repair":[53,105,128],"groups":[54,106,129],"locality":[58,101],"for":[59,70,102,107],"information":[61,109],"symbol.":[62],"No":[63],"bound":[64,114],"on":[65,115,150],"minimum":[66,117,138],"Hamming":[67],"distance":[68,119],"exists":[69],"this":[75],"scenario.":[76],"also":[81],"locally":[82],"multiple":[84],"a":[87,113],"group.":[89],"But":[90],"disk":[92],"I/O":[93],"higher.":[95],"We":[96,123,141],"construct":[97],"derive":[112],"hamming":[118,139],"these":[121],"codes.":[122,152],"show":[124,142],"protected":[132],"by":[133],"distances.":[140],"based":[149],"pyramid":[151]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}