{"id":"https://openalex.org/W2963265502","doi":"https://doi.org/10.1109/ncc.2019.8732208","title":"Maximally Recoverable Codes with Hierarchical Locality","display_name":"Maximally Recoverable Codes with Hierarchical Locality","publication_year":2019,"publication_date":"2019-02-01","ids":{"openalex":"https://openalex.org/W2963265502","doi":"https://doi.org/10.1109/ncc.2019.8732208","mag":"2963265502"},"language":"en","primary_location":{"id":"doi:10.1109/ncc.2019.8732208","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ncc.2019.8732208","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 National Conference on Communications (NCC)","raw_type":"proceedings-article"},"type":"preprint","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/A5091666267","display_name":"Aaditya M. Nair","orcid":null},"institutions":[{"id":"https://openalex.org/I64189192","display_name":"International Institute of Information Technology, Hyderabad","ror":"https://ror.org/05f11g639","country_code":"IN","type":"education","lineage":["https://openalex.org/I64189192"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Aaditya M. Nair","raw_affiliation_strings":["Signal Processing & Communications Research Center, International Institute of Information Technology Hyderabad, India"],"affiliations":[{"raw_affiliation_string":"Signal Processing & Communications Research Center, International Institute of Information Technology Hyderabad, India","institution_ids":["https://openalex.org/I64189192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110717612","display_name":"V. Lalitha","orcid":null},"institutions":[{"id":"https://openalex.org/I64189192","display_name":"International Institute of Information Technology, Hyderabad","ror":"https://ror.org/05f11g639","country_code":"IN","type":"education","lineage":["https://openalex.org/I64189192"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"V. Lalitha","raw_affiliation_strings":["Signal Processing & Communications Research Center, International Institute of Information Technology Hyderabad, India"],"affiliations":[{"raw_affiliation_string":"Signal Processing & Communications Research Center, International Institute of Information Technology Hyderabad, India","institution_ids":["https://openalex.org/I64189192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5091666267"],"corresponding_institution_ids":["https://openalex.org/I64189192"],"apc_list":null,"apc_paid":null,"fwci":1.35915303,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.81440766,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"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.9361000061035156,"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/T10237","display_name":"Cryptography and Data Security","score":0.9150999784469604,"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.94759202003479},{"id":"https://openalex.org/keywords/erasure-code","display_name":"Erasure code","score":0.5889343619346619},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5643960237503052},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.5032216906547546},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.48232123255729675},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4635220468044281},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.4159669876098633},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38253581523895264},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.332064151763916},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.13651302456855774},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.06076040863990784}],"concepts":[{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.94759202003479},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.5889343619346619},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5643960237503052},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.5032216906547546},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.48232123255729675},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4635220468044281},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.4159669876098633},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38253581523895264},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.332064151763916},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.13651302456855774},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.06076040863990784},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ncc.2019.8732208","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ncc.2019.8732208","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 National Conference on Communications (NCC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1629889498","https://openalex.org/W1866030559","https://openalex.org/W1993830711","https://openalex.org/W2060646539","https://openalex.org/W2069554151","https://openalex.org/W2124961791","https://openalex.org/W2333324284","https://openalex.org/W2555108336","https://openalex.org/W2744311935","https://openalex.org/W2887053791","https://openalex.org/W2892776878","https://openalex.org/W2895239415","https://openalex.org/W2956089011","https://openalex.org/W2964326991","https://openalex.org/W2964892028"],"related_works":["https://openalex.org/W2982181605","https://openalex.org/W2137028263","https://openalex.org/W2130518071","https://openalex.org/W3102119340","https://openalex.org/W1694938350","https://openalex.org/W2744779861","https://openalex.org/W2031335939","https://openalex.org/W3184492641","https://openalex.org/W2115768470","https://openalex.org/W2951344115"],"abstract_inverted_index":{"Maximally":[0],"recoverable":[1,13,80],"codes":[2,7,27,35,72,81,96],"are":[3],"a":[4,102,115,133,141],"class":[5],"of":[6,20,34,40,63,117,127,136],"which":[8,48],"recover":[9],"from":[10,109],"all":[11,122],"potentially":[12],"erasure":[14],"patterns":[15],"given":[16],"the":[17,21,32,58,61,67,125],"locality":[18,41,51,68,76],"constraints":[19,69],"code.":[22],"In":[23],"earlier":[24],"works,":[25],"these":[26],"have":[28],"been":[29,43],"studied":[30],"in":[31,55,60],"context":[33],"with":[36,57,73,82],"locality.":[37,87],"The":[38],"notion":[39],"has":[42],"extended":[44],"to":[45,52,93,104],"hierarchical":[46,75,86,106,110,118,137],"locality,":[47],"allows":[49],"for":[50,121],"gradually":[53],"increase":[54,59],"levels":[56],"number":[62],"erasures.":[64],"We":[65,88,100,113],"consider":[66],"imposed":[70],"by":[71],"two-level":[74],"and":[77,84,97],"define":[78],"maximally":[79],"data-local":[83,107],"local":[85,111,119,138],"derive":[89],"certain":[90],"properties":[91],"related":[92],"their":[94],"punctured":[95],"minimum":[98],"distance.":[99],"give":[101],"procedure":[103],"construct":[105],"MRCs":[108,120],"MRCs.":[112],"provide":[114,132],"construction":[116,135],"parameters.":[123],"For":[124],"case":[126],"one":[128],"global":[129],"parity,":[130],"we":[131],"different":[134],"MRC":[139],"over":[140],"lower":[142],"field":[143],"size.":[144]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}