{"id":"https://openalex.org/W1633095399","doi":"https://doi.org/10.1109/isit.2015.7282815","title":"Optimal fractional repetition codes and fractional repetition batch codes","display_name":"Optimal fractional repetition codes and fractional repetition batch codes","publication_year":2015,"publication_date":"2015-06-01","ids":{"openalex":"https://openalex.org/W1633095399","doi":"https://doi.org/10.1109/isit.2015.7282815","mag":"1633095399"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2015.7282815","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2015.7282815","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 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/A5090764037","display_name":"Natalia Silberstein","orcid":"https://orcid.org/0000-0003-4857-3214"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Natalia Silberstein","raw_affiliation_strings":["Computer Science Department, Technion-Israel Institute of Technology, Haifa, Israel","Computer Science Department, Technion -- Israel Institute of Technology, Haifa 32000, Israel#TAB#"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Technion-Israel Institute of Technology, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]},{"raw_affiliation_string":"Computer Science Department, Technion -- Israel Institute of Technology, Haifa 32000, Israel#TAB#","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062149532","display_name":"Tuvi Etzion","orcid":"https://orcid.org/0000-0002-4315-4400"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Tuvi Etzion","raw_affiliation_strings":["Computer Science Department, Technion-Israel Institute of Technology, Haifa, Israel","Computer Science Department, Technion -- Israel Institute of Technology, Haifa 32000, Israel#TAB#"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Technion-Israel Institute of Technology, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]},{"raw_affiliation_string":"Computer Science Department, Technion -- Israel Institute of Technology, Haifa 32000, Israel#TAB#","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5090764037"],"corresponding_institution_ids":["https://openalex.org/I174306211"],"apc_list":null,"apc_paid":null,"fwci":0.3328,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.63542562,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"2046","last_page":"2050"},"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/T12162","display_name":"Cellular Automata and Applications","score":0.994700014591217,"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/T11478","display_name":"Caching and Content Delivery","score":0.926800012588501,"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/block-code","display_name":"Block code","score":0.5605531334877014},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.5529390573501587},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5193853974342346},{"id":"https://openalex.org/keywords/repetition","display_name":"Repetition (rhetorical device)","score":0.5190037488937378},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5148100256919861},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5102331638336182},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37944576144218445},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36195966601371765},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2808380126953125},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.1646154224872589}],"concepts":[{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.5605531334877014},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.5529390573501587},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5193853974342346},{"id":"https://openalex.org/C2776141515","wikidata":"https://www.wikidata.org/wiki/Q1274479","display_name":"Repetition (rhetorical device)","level":2,"score":0.5190037488937378},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5148100256919861},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5102331638336182},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37944576144218445},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36195966601371765},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2808380126953125},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.1646154224872589},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/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/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2015.7282815","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2015.7282815","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Symposium on Information Theory (ISIT)","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":27,"referenced_works":["https://openalex.org/W91720587","https://openalex.org/W618563251","https://openalex.org/W1515707356","https://openalex.org/W1989092389","https://openalex.org/W2054837881","https://openalex.org/W2055241129","https://openalex.org/W2088336724","https://openalex.org/W2105185344","https://openalex.org/W2118917487","https://openalex.org/W2120770247","https://openalex.org/W2139848116","https://openalex.org/W2143174824","https://openalex.org/W2153923251","https://openalex.org/W2194772305","https://openalex.org/W2399878410","https://openalex.org/W2479778494","https://openalex.org/W2952472963","https://openalex.org/W2962720639","https://openalex.org/W3100341193","https://openalex.org/W3112923198","https://openalex.org/W4212992501","https://openalex.org/W4285719527","https://openalex.org/W4297416021","https://openalex.org/W6603707970","https://openalex.org/W6677864051","https://openalex.org/W6712407358","https://openalex.org/W6718160426"],"related_works":["https://openalex.org/W135568846","https://openalex.org/W2460434904","https://openalex.org/W1789159349","https://openalex.org/W2113911300","https://openalex.org/W832867880","https://openalex.org/W2147254059","https://openalex.org/W2151857680","https://openalex.org/W4386066307","https://openalex.org/W917159298","https://openalex.org/W1975697476"],"abstract_inverted_index":{"Fractional":[0],"repetition":[1,109],"(FR)":[2],"codes":[3,8,46,58,94,104],"is":[4],"a":[5,28,90,100],"family":[6,102],"of":[7,34,55,63,103],"for":[9,105],"distributed":[10],"storage":[11],"systems":[12],"(DSS)":[13],"that":[14,36],"allow":[15,113],"uncoded":[16,114],"exact":[17,116],"repairs":[18,117],"with":[19,72],"minimum":[20],"repair":[21],"bandwidth.":[22],"In":[23,86],"this":[24,49],"work,":[25],"we":[26,98],"consider":[27],"bound":[29,50],"on":[30,61,76,89],"the":[31],"maximum":[32],"amount":[33],"data":[35],"can":[37,122],"be":[38,123],"stored":[39],"using":[40],"an":[41],"FR":[42,45,57,93],"code.":[43],"Optimal":[44],"which":[47,112,121],"attain":[48],"are":[51,59],"presented.":[52],"The":[53],"constructions":[54],"these":[56],"based":[60,88],"families":[62],"regular":[64],"graphs,":[65],"such":[66,79],"as":[67,80],"Tur\u00e1n":[68],"graphs":[69,71],"and":[70,75,83,95,118],"large":[73],"girth;":[74],"combinatorial":[77],"designs,":[78],"transversal":[81],"designs":[82],"generalized":[84],"polygons.":[85],"addition,":[87],"connection":[91],"between":[92],"batch":[96,110],"codes,":[97,111],"propose":[99],"new":[101],"DSS,":[106],"called":[107],"fractional":[108],"efficient":[115],"load":[119],"balancing":[120],"performed":[124],"by":[125],"several":[126],"users":[127],"in":[128],"parallel.":[129]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}