{"id":"https://openalex.org/W2017346026","doi":"https://doi.org/10.1109/isit.2014.6874918","title":"Binary cyclic codes that are locally repairable","display_name":"Binary cyclic codes that are locally repairable","publication_year":2014,"publication_date":"2014-06-01","ids":{"openalex":"https://openalex.org/W2017346026","doi":"https://doi.org/10.1109/isit.2014.6874918","mag":"2017346026"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2014.6874918","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2014.6874918","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1609.08935","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5037170329","display_name":"Sreechakra Goparaju","orcid":"https://orcid.org/0000-0003-3282-5990"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sreechakra Goparaju","raw_affiliation_strings":["Department of Electrical Engineering, Princeton University, Princeton, NJ, USA","Dept. of Electr. Eng., Princeton Univ., Princeton, NJ, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Princeton University, Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Dept. of Electr. Eng., Princeton Univ., Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037795370","display_name":"Robert Calderbank","orcid":"https://orcid.org/0000-0003-2084-9717"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert Calderbank","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Duke University, Durham, NC, USA","Dept. of Electr. & Comput. Eng., Duke Univ., Durham, NC, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Duke University, Durham, NC, USA","institution_ids":["https://openalex.org/I170897317"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Duke Univ., Durham, NC, USA#TAB#","institution_ids":["https://openalex.org/I170897317"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5037170329"],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":null,"apc_paid":null,"fwci":18.7049,"has_fulltext":false,"cited_by_count":129,"citation_normalized_percentile":{"value":0.99422956,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"676","last_page":"680"},"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.9957000017166138,"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.9490000009536743,"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/locality","display_name":"Locality","score":0.8009476661682129},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.7177366018295288},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.639333963394165},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.59249347448349},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5443158149719238},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5295946002006531},{"id":"https://openalex.org/keywords/binary-code","display_name":"Binary code","score":0.43349334597587585},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.43213406205177307},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.4167672097682953},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.378055602312088},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3640402555465698},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3378874659538269},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.20935788750648499},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.14561805129051208},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.1389554738998413},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.12215793132781982}],"concepts":[{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.8009476661682129},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.7177366018295288},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.639333963394165},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.59249347448349},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5443158149719238},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5295946002006531},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.43349334597587585},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.43213406205177307},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.4167672097682953},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.378055602312088},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3640402555465698},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3378874659538269},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.20935788750648499},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.14561805129051208},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.1389554738998413},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.12215793132781982},{"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},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2014.6874918","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2014.6874918","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1609.08935","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1609.08935","pdf_url":"https://arxiv.org/pdf/1609.08935","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1609.08935","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1609.08935","pdf_url":"https://arxiv.org/pdf/1609.08935","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W154253821","https://openalex.org/W1537045696","https://openalex.org/W1606480398","https://openalex.org/W1977073502","https://openalex.org/W1991499930","https://openalex.org/W1993830711","https://openalex.org/W1995147907","https://openalex.org/W1997044393","https://openalex.org/W2006551665","https://openalex.org/W2008976700","https://openalex.org/W2021662392","https://openalex.org/W2050413942","https://openalex.org/W2050500290","https://openalex.org/W2080339104","https://openalex.org/W2099837838","https://openalex.org/W2105185344","https://openalex.org/W2119565742","https://openalex.org/W2119738171","https://openalex.org/W2138744797","https://openalex.org/W2150777202","https://openalex.org/W2159028410","https://openalex.org/W2161104579","https://openalex.org/W2550412208","https://openalex.org/W2963063105","https://openalex.org/W2963178700","https://openalex.org/W3103425664","https://openalex.org/W3106482607","https://openalex.org/W4239670432","https://openalex.org/W6606324823","https://openalex.org/W6632200215","https://openalex.org/W6653247145"],"related_works":["https://openalex.org/W2134880816","https://openalex.org/W2111298487","https://openalex.org/W2055498716","https://openalex.org/W4386075138","https://openalex.org/W1984130439","https://openalex.org/W2109703172","https://openalex.org/W3016499519","https://openalex.org/W2371359060","https://openalex.org/W2562873141","https://openalex.org/W2510680828"],"abstract_inverted_index":{"Codes":[0],"for":[1,72,88,136],"storage":[2],"systems":[3],"aim":[4],"to":[5,42,49,128],"minimize":[6],"the":[7,12,21,29,106,111],"repair":[8,22,116,134],"locality,":[9],"which":[10],"is":[11],"number":[13,52],"of":[14,23,53,62,113,121],"disks":[15],"(or":[16],"nodes)":[17],"that":[18,66,84,131],"participate":[19],"in":[20],"a":[24,33,38,50,73],"single":[25],"failed":[26],"disk.":[27,138],"Simultaneously,":[28],"code":[30,107],"must":[31],"sustain":[32],"high":[34],"rate,":[35],"operate":[36],"on":[37,105],"small":[39],"finite":[40],"field":[41],"be":[43,47],"practically":[44],"significant":[45],"and":[46,77,91,95,109],"tolerant":[48],"large":[51],"erasures.":[54],"To":[55],"this":[56],"end,":[57],"we":[58,80,100,124],"construct":[59,81],"new":[60,102],"families":[61],"binary":[63],"linear":[64],"codes":[65,83,130],"have":[67,132],"an":[68],"optimal":[69],"dimension":[70],"(rate)":[71],"given":[74],"minimum":[75],"distance":[76],"locality.":[78],"Specifically,":[79],"cyclic":[82],"are":[85],"locally":[86],"repairable":[87],"locality":[89],"2":[90],"distances":[92],"2,":[93],"6":[94],"10.":[96],"In":[97],"doing":[98],"so,":[99],"discover":[101],"upper":[103],"bounds":[104],"dimension,":[108],"prove":[110],"optimality":[112],"enabling":[114],"local":[115],"by":[117],"provisioning":[118],"disjoint":[119],"groups":[120],"disks.":[122],"Finally,":[123],"extend":[125],"our":[126],"construction":[127],"build":[129],"multiple":[133],"sets":[135],"each":[137]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":16},{"year":2019,"cited_by_count":13},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":21},{"year":2016,"cited_by_count":15},{"year":2015,"cited_by_count":15},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-07T14:57:38.498316","created_date":"2025-10-10T00:00:00"}