{"id":"https://openalex.org/W2577564671","doi":"https://doi.org/10.1109/isit.2017.8006511","title":"Rate optimal binary linear locally repairable codes with small availability","display_name":"Rate optimal binary linear locally repairable codes with small availability","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2577564671","doi":"https://doi.org/10.1109/isit.2017.8006511","mag":"2577564671"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2017.8006511","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006511","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1701.02456","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5053049612","display_name":"Swanand Kadhe","orcid":"https://orcid.org/0000-0003-2006-1030"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Swanand Kadhe","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Texas A&M University, USA","[Department of Electrical and Computer Engineering at Texas A&M University, USA]"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Texas A&M University, USA","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"[Department of Electrical and Computer Engineering at Texas A&M University, USA]","institution_ids":["https://openalex.org/I91045830"]}]},{"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, USA","Department of Electrical and Computer Engineering at Duke University, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Duke University, USA","institution_ids":["https://openalex.org/I170897317"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering at Duke University, USA","institution_ids":["https://openalex.org/I170897317"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5053049612"],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":0.4379,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.65196303,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"166","last_page":"170"},"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.9817000031471252,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9692000150680542,"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/dual-polyhedron","display_name":"Dual polyhedron","score":0.6401695609092712},{"id":"https://openalex.org/keywords/prefix-code","display_name":"Prefix code","score":0.5966165065765381},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.5881422162055969},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.5706033110618591},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5587034821510315},{"id":"https://openalex.org/keywords/binary-code","display_name":"Binary code","score":0.5200831294059753},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5101156830787659},{"id":"https://openalex.org/keywords/code-rate","display_name":"Code rate","score":0.5093978047370911},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5086225271224976},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5045984983444214},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4979679584503174},{"id":"https://openalex.org/keywords/dual-code","display_name":"Dual code","score":0.4543763995170593},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.45002490282058716},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.4446665048599243},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.31411242485046387},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2859199643135071},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.16782137751579285},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.0945652425289154}],"concepts":[{"id":"https://openalex.org/C105313907","wikidata":"https://www.wikidata.org/wiki/Q1053857","display_name":"Dual polyhedron","level":2,"score":0.6401695609092712},{"id":"https://openalex.org/C20079647","wikidata":"https://www.wikidata.org/wiki/Q1278039","display_name":"Prefix code","level":5,"score":0.5966165065765381},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.5881422162055969},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.5706033110618591},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5587034821510315},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.5200831294059753},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5101156830787659},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.5093978047370911},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5086225271224976},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5045984983444214},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4979679584503174},{"id":"https://openalex.org/C73666251","wikidata":"https://www.wikidata.org/wiki/Q5310189","display_name":"Dual code","level":5,"score":0.4543763995170593},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.45002490282058716},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.4446665048599243},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.31411242485046387},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2859199643135071},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.16782137751579285},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0945652425289154},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/isit.2017.8006511","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006511","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1701.02456","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1701.02456","pdf_url":"https://arxiv.org/pdf/1701.02456","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"},{"id":"mag:2577564671","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1701.02456.pdf","pdf_url":null,"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":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.1701.02456","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1701.02456","pdf_url":null,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1701.02456","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1701.02456","pdf_url":"https://arxiv.org/pdf/1701.02456","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":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2577564671.pdf","grobid_xml":"https://content.openalex.org/works/W2577564671.grobid-xml"},"referenced_works_count":45,"referenced_works":["https://openalex.org/W154253821","https://openalex.org/W411845244","https://openalex.org/W1441763937","https://openalex.org/W1584208130","https://openalex.org/W1638607647","https://openalex.org/W1957362188","https://openalex.org/W1993830711","https://openalex.org/W1994069625","https://openalex.org/W1997044393","https://openalex.org/W2014149071","https://openalex.org/W2017346026","https://openalex.org/W2018102393","https://openalex.org/W2022619326","https://openalex.org/W2025216096","https://openalex.org/W2037127812","https://openalex.org/W2050413942","https://openalex.org/W2050500290","https://openalex.org/W2058863419","https://openalex.org/W2073529360","https://openalex.org/W2080339104","https://openalex.org/W2099837838","https://openalex.org/W2105185344","https://openalex.org/W2126655674","https://openalex.org/W2140420067","https://openalex.org/W2155418912","https://openalex.org/W2249486791","https://openalex.org/W2254980137","https://openalex.org/W2335546159","https://openalex.org/W2505254502","https://openalex.org/W2548110501","https://openalex.org/W2550412208","https://openalex.org/W2559264809","https://openalex.org/W2949607990","https://openalex.org/W2949925098","https://openalex.org/W2951572681","https://openalex.org/W2951896066","https://openalex.org/W2962775071","https://openalex.org/W2963019117","https://openalex.org/W2963120590","https://openalex.org/W2963944222","https://openalex.org/W3100282565","https://openalex.org/W3104733961","https://openalex.org/W3106482607","https://openalex.org/W6606324823","https://openalex.org/W6632200215"],"related_works":["https://openalex.org/W2963019117","https://openalex.org/W2155418912","https://openalex.org/W2743828621","https://openalex.org/W3182892613","https://openalex.org/W3104944838","https://openalex.org/W2783068971","https://openalex.org/W2604774093","https://openalex.org/W3010113848","https://openalex.org/W2913294625","https://openalex.org/W2440761015","https://openalex.org/W3104559424","https://openalex.org/W3179720698","https://openalex.org/W3136820369","https://openalex.org/W2963890921","https://openalex.org/W2885726234","https://openalex.org/W2534132741","https://openalex.org/W2741278315","https://openalex.org/W3102225876","https://openalex.org/W3197379005","https://openalex.org/W2609901020"],"abstract_inverted_index":{"A":[0,52],"locally":[1,157,180],"repairable":[2,158,181],"code":[3,11,29,53,141],"with":[4,54,72,87,107,133,161,170,182,191],"availability":[5,55],"has":[6],"the":[7,68,101,167,171,188],"property":[8],"that":[9,125,176,187],"every":[10],"symbol":[12,30],"can":[13,39],"be":[14,40,59,143],"recovered":[15,41],"from":[16,42],"multiple,":[17],"disjoint":[18,44],"subsets":[19],"of":[20,23,47,70,103,129,147,156,199],"other":[21],"symbols":[22],"small":[24,88],"size.":[25,78],"In":[26],"particular,":[27],"a":[28,117,144,154],"is":[31,56,65],"said":[32,57],"to":[33,58],"have":[34],"(r,":[35,108,134],"t)-availability":[36],"if":[37,62],"it":[38,95,115,152],"t":[43,183],"subsets,":[45],"each":[46,200],"size":[48],"at":[49],"most":[50],"r.":[51],"rate":[60,64,102],"optimal,":[61],"its":[63],"maximum":[66],"among":[67],"class":[69,155],"codes":[71,86,106,132,159,168,178,189],"given":[73],"locality,":[74],"availability,":[75,89],"and":[76,90,110,136,186],"alphabet":[77],"This":[79],"paper":[80],"focuses":[81],"on":[82,100,166],"rate-optimal":[83,122,140,149],"binary,":[84],"linear":[85,105,131],"makes":[91],"three":[92],"contributions.":[93],"First,":[94],"establishes":[96,116],"tight":[97],"upper":[98],"bounds":[99],"binary":[104,121,130],"2)":[109,135],"(2,":[111,137],"3)":[112],"availability.":[113],"Second,":[114],"uniqueness":[118],"result":[119],"for":[120,126],"codes,":[123],"showing":[124],"certain":[127],"classes":[128],"3)-availability,":[138],"any":[139],"must":[142],"direct":[145],"sum":[146],"shorter":[148],"codes.":[150],"Finally,":[151],"presents":[153],"associated":[160,169,190],"convex":[162],"polyhedra,":[163],"especially,":[164],"focusing":[165],"Platonic":[172],"solids.":[173],"It":[174],"demonstrates":[175],"these":[177],"are":[179,195],"=":[184],"2,":[185],"(geometric)":[192],"dual":[193],"polyhedra":[194],"(coding":[196],"theoretic)":[197],"duals":[198],"other.":[201]},"counts_by_year":[{"year":2018,"cited_by_count":2}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}
