{"id":"https://openalex.org/W2962815283","doi":"https://doi.org/10.1109/isit.2018.8437455","title":"Codes with Combined Locality and Regeneration Having Optimal Rate, &lt;tex&gt;$d_{\\min}$&lt;/tex&gt; and Linear Field Size","display_name":"Codes with Combined Locality and Regeneration Having Optimal Rate, &lt;tex&gt;$d_{\\min}$&lt;/tex&gt; and Linear Field Size","publication_year":2018,"publication_date":"2018-06-01","ids":{"openalex":"https://openalex.org/W2962815283","doi":"https://doi.org/10.1109/isit.2018.8437455","mag":"2962815283"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2018.8437455","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2018.8437455","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 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/A5056042146","display_name":"M. Nikhil Krishnan","orcid":"https://orcid.org/0000-0003-0089-676X"},"institutions":[{"id":"https://openalex.org/I59270414","display_name":"Indian Institute of Science Bangalore","ror":"https://ror.org/04dese585","country_code":"IN","type":"education","lineage":["https://openalex.org/I59270414"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"M. Nikhil Krishnan","raw_affiliation_strings":["Department of Electrical Communication Engineering, Indian Institute of Science, Bangalore"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Communication Engineering, Indian Institute of Science, Bangalore","institution_ids":["https://openalex.org/I59270414"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070785518","display_name":"Anantha Narayanan R","orcid":null},"institutions":[{"id":"https://openalex.org/I59270414","display_name":"Indian Institute of Science Bangalore","ror":"https://ror.org/04dese585","country_code":"IN","type":"education","lineage":["https://openalex.org/I59270414"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Anantha Narayanan R","raw_affiliation_strings":["Department of Electrical Communication Engineering, Indian Institute of Science, Bangalore"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Communication Engineering, Indian Institute of Science, Bangalore","institution_ids":["https://openalex.org/I59270414"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000294837","display_name":"P. Vijay Kumar","orcid":"https://orcid.org/0000-0003-0990-2847"},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]},{"id":"https://openalex.org/I2800817003","display_name":"Southern California University for Professional Studies","ror":"https://ror.org/058zz0t50","country_code":"US","type":"education","lineage":["https://openalex.org/I2800817003"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"P. Vijay Kumar","raw_affiliation_strings":["University of Southern California"],"affiliations":[{"raw_affiliation_string":"University of Southern California","institution_ids":["https://openalex.org/I2800817003","https://openalex.org/I1174212"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5056042146"],"corresponding_institution_ids":["https://openalex.org/I59270414"],"apc_list":null,"apc_paid":null,"fwci":0.9227,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.79172791,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1196","last_page":"1200"},"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/T11478","display_name":"Caching and Content Delivery","score":0.9994000196456909,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9954000115394592,"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/locality","display_name":"Locality","score":0.7353822588920593},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.640911340713501},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.5316833853721619},{"id":"https://openalex.org/keywords/code-rate","display_name":"Code rate","score":0.482048362493515},{"id":"https://openalex.org/keywords/symbol","display_name":"Symbol (formal)","score":0.4677565097808838},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45435962080955505},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4139166474342346},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3864961266517639},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.29701852798461914},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.15354570746421814}],"concepts":[{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.7353822588920593},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.640911340713501},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.5316833853721619},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.482048362493515},{"id":"https://openalex.org/C134400042","wikidata":"https://www.wikidata.org/wiki/Q2372244","display_name":"Symbol (formal)","level":2,"score":0.4677565097808838},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45435962080955505},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4139166474342346},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3864961266517639},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.29701852798461914},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.15354570746421814},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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},{"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/isit.2018.8437455","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2018.8437455","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 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":21,"referenced_works":["https://openalex.org/W1866030559","https://openalex.org/W1993830711","https://openalex.org/W1997044393","https://openalex.org/W2069554151","https://openalex.org/W2105185344","https://openalex.org/W2150777202","https://openalex.org/W2153923251","https://openalex.org/W2414247331","https://openalex.org/W2492240243","https://openalex.org/W2582252045","https://openalex.org/W2743142859","https://openalex.org/W2963711369","https://openalex.org/W2963781977","https://openalex.org/W3100004208","https://openalex.org/W3100282565","https://openalex.org/W3106482607","https://openalex.org/W6716351874","https://openalex.org/W6722678105","https://openalex.org/W6732894315","https://openalex.org/W6785086341","https://openalex.org/W7017893704"],"related_works":["https://openalex.org/W1555349535","https://openalex.org/W2389793738","https://openalex.org/W1556451512","https://openalex.org/W4390358280","https://openalex.org/W2376208682","https://openalex.org/W4246219814","https://openalex.org/W4240806619","https://openalex.org/W2248517968","https://openalex.org/W1026742762","https://openalex.org/W3182892613"],"abstract_inverted_index":{"In":[0,29,70],"this":[1,108],"paper,":[2],"we":[3,33,82],"study":[4],"vector":[5,35],"codes":[6,36,53,59,66,77],"with":[7,37,76,117],"all-symbol":[8,38,79],"locality,":[9,40,81],"where":[10],"the":[11,30,61,71,103,118],"local":[12],"code":[13,21,104],"is":[14],"either":[15],"a":[16,23,84,98,111],"Minimum":[17,24],"Bandwidth":[18],"Regenerating":[19,26],"(MBR)":[20],"or":[22],"Storage":[25],"(MSR)":[27],"code.":[28],"first":[31],"part,":[32],"present":[34],"MBR":[39],"for":[41,97],"all":[42],"parameters,":[43],"that":[44,114],"have":[45,110],"both":[46],"optimal":[47,50,92,95],"minimum-distance":[48,93],"and":[49,67,94],"rate.":[51],"These":[52],"combine":[54],"ideas":[55],"from":[56],"two":[57],"popular":[58],"in":[60,107],"distributed":[62],"storage":[63],"literature;":[64],"Product-Matrix":[65],"Tamo-Barg":[68],"codes.":[69],"second":[72],"part":[73],"which":[74],"deals":[75],"having":[78],"MSR":[80],"follow":[83],"Pairwise":[85],"Coupling":[86],"Transform-based":[87],"approach":[88],"to":[89],"arrive":[90],"at":[91],"rate,":[96],"range":[99],"of":[100],"parameters.":[101],"All":[102],"constructions":[105],"presented":[106],"paper":[109],"low":[112],"field-size":[113],"grows":[115],"linearly":[116],"code-length":[119],"n.":[120]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
