{"id":"https://openalex.org/W2346174568","doi":"https://doi.org/10.1109/isit.2015.7282701","title":"Batch codes through dense graphs without short cycles","display_name":"Batch codes through dense graphs without short cycles","publication_year":2015,"publication_date":"2015-06-01","ids":{"openalex":"https://openalex.org/W2346174568","doi":"https://doi.org/10.1109/isit.2015.7282701","mag":"2346174568"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2015.7282701","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2015.7282701","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/A5079621556","display_name":"Ankit Singh Rawat","orcid":"https://orcid.org/0000-0001-9790-6500"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ankit Singh Rawat","raw_affiliation_strings":["Dept. of Electrical and Computer Engineering, University of Texas at Austin, Austin, USA"],"affiliations":[{"raw_affiliation_string":"Dept. of Electrical and Computer Engineering, University of Texas at Austin, Austin, USA","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103280080","display_name":"Zhao Song","orcid":"https://orcid.org/0000-0003-4589-5234"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhao Song","raw_affiliation_strings":["Dept. of ComputerScience, University of Texas at Austin, Austin, USA"],"affiliations":[{"raw_affiliation_string":"Dept. of ComputerScience, University of Texas at Austin, Austin, USA","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014141359","display_name":"Alexandros G. Dimakis","orcid":"https://orcid.org/0000-0002-4244-7033"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alexandros G. Dimakis","raw_affiliation_strings":["Dept. of Electrical and Computer Engineering, University of Texas at Austin, Austin, USA"],"affiliations":[{"raw_affiliation_string":"Dept. of Electrical and Computer Engineering, University of Texas at Austin, Austin, USA","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078455094","display_name":"Anna G\u00e1l","orcid":"https://orcid.org/0000-0001-9772-3966"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Anna Gal","raw_affiliation_strings":["Dept. of ComputerScience, University of Texas at Austin, Austin, USA"],"affiliations":[{"raw_affiliation_string":"Dept. of ComputerScience, University of Texas at Austin, Austin, USA","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5079621556"],"corresponding_institution_ids":["https://openalex.org/I86519309"],"apc_list":null,"apc_paid":null,"fwci":2.3298,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.90266939,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"abs 1312 5505","issue":null,"first_page":"1477","last_page":"1481"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9998000264167786,"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.9998000264167786,"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.9980000257492065,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9858999848365784,"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/multiset","display_name":"Multiset","score":0.948037326335907},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.8083814382553101},{"id":"https://openalex.org/keywords/tanner-graph","display_name":"Tanner graph","score":0.6238346099853516},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5390559434890747},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.48911052942276},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.48511970043182373},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.41645893454551697},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4130347967147827},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41224777698516846},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39429569244384766},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38461166620254517},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3326300084590912},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2930949628353119},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.2877498269081116},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.18373018503189087}],"concepts":[{"id":"https://openalex.org/C2779623528","wikidata":"https://www.wikidata.org/wiki/Q864377","display_name":"Multiset","level":2,"score":0.948037326335907},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8083814382553101},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.6238346099853516},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5390559434890747},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.48911052942276},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.48511970043182373},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.41645893454551697},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4130347967147827},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41224777698516846},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39429569244384766},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38461166620254517},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3326300084590912},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2930949628353119},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.2877498269081116},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.18373018503189087},{"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/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2015.7282701","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2015.7282701","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.743.4570","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.743.4570","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1410.2920.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":56,"referenced_works":["https://openalex.org/W154253821","https://openalex.org/W630031768","https://openalex.org/W1510496002","https://openalex.org/W1536930200","https://openalex.org/W1583183878","https://openalex.org/W1606480398","https://openalex.org/W1617915743","https://openalex.org/W1965501765","https://openalex.org/W1969237081","https://openalex.org/W1974401809","https://openalex.org/W1974719812","https://openalex.org/W1993830711","https://openalex.org/W1995147907","https://openalex.org/W1997044393","https://openalex.org/W2006551665","https://openalex.org/W2014149071","https://openalex.org/W2018102393","https://openalex.org/W2021999231","https://openalex.org/W2022587973","https://openalex.org/W2048651540","https://openalex.org/W2050413942","https://openalex.org/W2055241129","https://openalex.org/W2058863419","https://openalex.org/W2058972589","https://openalex.org/W2060200869","https://openalex.org/W2069554151","https://openalex.org/W2079125810","https://openalex.org/W2087806988","https://openalex.org/W2088336724","https://openalex.org/W2092292480","https://openalex.org/W2105185344","https://openalex.org/W2105537253","https://openalex.org/W2117246793","https://openalex.org/W2124679036","https://openalex.org/W2138744797","https://openalex.org/W2148575324","https://openalex.org/W2346174568","https://openalex.org/W2550412208","https://openalex.org/W2595628957","https://openalex.org/W2901747112","https://openalex.org/W2949514404","https://openalex.org/W2950534813","https://openalex.org/W2951944286","https://openalex.org/W2963487294","https://openalex.org/W3100282565","https://openalex.org/W3101824114","https://openalex.org/W3112923198","https://openalex.org/W3146758888","https://openalex.org/W6606324823","https://openalex.org/W6636482341","https://openalex.org/W6649546340","https://openalex.org/W6655110552","https://openalex.org/W6678261927","https://openalex.org/W6712231376","https://openalex.org/W6788023796","https://openalex.org/W6793148002"],"related_works":["https://openalex.org/W2125154953","https://openalex.org/W2521082822","https://openalex.org/W2354117331","https://openalex.org/W1997015668","https://openalex.org/W1941604706","https://openalex.org/W2346174568","https://openalex.org/W2951944286","https://openalex.org/W2397797402","https://openalex.org/W3080746295","https://openalex.org/W2544230084"],"abstract_inverted_index":{"Consider":[0],"a":[1,24,82,126],"large":[2,25],"database":[3],"of":[4,28,52,67,75,84,92,98,129,147],"n":[5],"data":[6],"items":[7],"that":[8,23],"need":[9],"to":[10,19,49,151,160],"be":[11,32],"stored":[12],"using":[13,134],"m":[14,86],"servers.":[15],"We":[16,64,142,157],"study":[17],"how":[18],"encode":[20],"information":[21],"so":[22],"number":[26,83,91],"k":[27],"read":[29,93],"requests":[30,94],"can":[31],"performed":[33],"in":[34,89],"parallel":[35],"while":[36],"the":[37,50,76,90,164],"rate":[38],"remains":[39],"constant":[40],"(and":[41],"ideally":[42],"approaches":[43],"one).":[44],"This":[45],"problem":[46],"is":[47,110,125],"equivalent":[48],"design":[51],"multiset":[53,68,107,131],"Batch":[54],"Codes":[55],"introduced":[56],"by":[57],"Ishai,":[58],"Kushilevitz,":[59],"Ostrovsky":[60],"and":[61,81,112,116],"Sahai":[62],"[1].":[63],"give":[65],"families":[66],"batch":[69,100,108,132,154,170],"codes":[70,109,133],"with":[71,138],"asymptotically":[72,117],"optimal":[73,118,161],"rates":[74],"form":[77],"1":[78],"-":[79],"1/poly(k)":[80],"servers":[85],"scaling":[87],"polynomially":[88],"k.":[95],"An":[96],"advantage":[97],"our":[99,153],"code":[101,155],"constructions":[102,146],"over":[103],"most":[104],"previously":[105],"known":[106],"explicit":[111],"deterministic":[113],"decoding":[114],"algorithms":[115],"fault":[119],"tolerance.":[120],"Our":[121],"main":[122],"technical":[123],"innovation":[124],"graph-theoretic":[127],"method":[128],"designing":[130],"dense":[135],"bipartite":[136,167],"graphs":[137,150],"no":[139],"small":[140],"cycles.":[141],"modify":[143],"prior":[144],"graph":[145,168],"dense,":[148],"high-girth":[149],"obtain":[152],"results.":[156],"achieve":[158],"close":[159],"tradeoffs":[162],"between":[163],"parameters":[165],"for":[166],"based":[169],"codes.":[171]},"counts_by_year":[{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}