{"id":"https://openalex.org/W2976573449","doi":"https://doi.org/10.1109/isit.2019.8849542","title":"Capacity-Achieving Private Information Retrieval Codes from MDS-Coded Databases with Minimum Message Size","display_name":"Capacity-Achieving Private Information Retrieval Codes from MDS-Coded Databases with Minimum Message Size","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W2976573449","doi":"https://doi.org/10.1109/isit.2019.8849542","mag":"2976573449"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2019.8849542","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849542","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5029262439","display_name":"Ruida Zhou","orcid":"https://orcid.org/0000-0002-8855-2031"},"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":false,"raw_author_name":"Ruida Zhou","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Texas A&M University","Department of Electrical and Computer Engineering, Texas A&M University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Texas A&M University","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Texas A&M University","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100675045","display_name":"Chao Tian","orcid":"https://orcid.org/0000-0001-8752-6141"},"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":false,"raw_author_name":"Chao Tian","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Texas A&M University","Department of Electrical and Computer Engineering, Texas A&M University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Texas A&M University","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Texas A&M University","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006265534","display_name":"Tie Liu","orcid":"https://orcid.org/0000-0002-6412-2432"},"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":false,"raw_author_name":"Tie Liu","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Texas A&M University","Department of Electrical and Computer Engineering, Texas A&M University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Texas A&M University","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Texas A&M University","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016951190","display_name":"Hua Sun","orcid":"https://orcid.org/0000-0001-8777-7987"},"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":false,"raw_author_name":"Hua Sun","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Texas A&M University","Department of Electrical and Computer Engineering, Texas A&M University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Texas A&M University","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Texas A&M University","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":1.8588,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.89966615,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":97,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"370","last_page":"374"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10237","display_name":"Cryptography and Data Security","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9994999766349792,"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/T11130","display_name":"Coding theory and cryptography","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/converse","display_name":"Converse","score":0.7665091156959534},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6086260676383972},{"id":"https://openalex.org/keywords/separable-space","display_name":"Separable space","score":0.5871052742004395},{"id":"https://openalex.org/keywords/greatest-common-divisor","display_name":"Greatest common divisor","score":0.5781227946281433},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.48243841528892517},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.469292014837265},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3831552267074585},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3705430030822754},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3526124954223633},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3390417695045471},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.336439847946167},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24856606125831604},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.14000028371810913}],"concepts":[{"id":"https://openalex.org/C2776809875","wikidata":"https://www.wikidata.org/wiki/Q1375963","display_name":"Converse","level":2,"score":0.7665091156959534},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6086260676383972},{"id":"https://openalex.org/C70710897","wikidata":"https://www.wikidata.org/wiki/Q680081","display_name":"Separable space","level":2,"score":0.5871052742004395},{"id":"https://openalex.org/C125257309","wikidata":"https://www.wikidata.org/wiki/Q131752","display_name":"Greatest common divisor","level":2,"score":0.5781227946281433},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.48243841528892517},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.469292014837265},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3831552267074585},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3705430030822754},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3526124954223633},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3390417695045471},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.336439847946167},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24856606125831604},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.14000028371810913},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/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.2019.8849542","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849542","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 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":14,"referenced_works":["https://openalex.org/W2007725949","https://openalex.org/W2073346043","https://openalex.org/W2260085643","https://openalex.org/W2547052808","https://openalex.org/W2599749253","https://openalex.org/W2890765571","https://openalex.org/W2961382438","https://openalex.org/W2962692592","https://openalex.org/W2962746473","https://openalex.org/W2976573449","https://openalex.org/W3006994039","https://openalex.org/W3105958450","https://openalex.org/W3106164725","https://openalex.org/W6753878976"],"related_works":["https://openalex.org/W2387449261","https://openalex.org/W2418518962","https://openalex.org/W2963377682","https://openalex.org/W2043159103","https://openalex.org/W2391769344","https://openalex.org/W2359260952","https://openalex.org/W4297790016","https://openalex.org/W2769269860","https://openalex.org/W2020701214","https://openalex.org/W2560325964"],"abstract_inverted_index":{"We":[0],"consider":[1],"constructing":[2],"capacity-achieving":[3],"linear":[4],"codes":[5,141],"with":[6,142],"minimum":[7,49,109],"message":[8,21,50,84,110,144],"size":[9,51,111,145],"for":[10],"private":[11],"information":[12],"retrieval":[13],"(PIR)":[14],"from":[15,36],"N":[16],"non-colluding":[17],"databases,":[18],"where":[19,77,116],"each":[20],"is":[22,45,60,79,129,135],"coded":[23],"using":[24],"maximum":[25],"distance":[26],"separable":[27],"(MDS)":[28],"codes,":[29],"such":[30],"that":[31,47,133],"it":[32,134],"can":[33],"be":[34],"recovered":[35],"reading":[37],"the":[38,48,57,80,86,91,108,119,124],"contents":[39],"of":[40,83],"any":[41],"T":[42],"databases.":[43],"It":[44],"shown":[46],"(sometimes":[52],"also":[53],"referred":[54],"to":[55,139],"as":[56,112],"sub-packetization":[58],"level)":[59],"significantly,":[61],"in":[62,85,136],"fact":[63,137],"exponentially,":[64],"lower":[65],"than":[66,148],"previously":[67],"believed.":[68],"More":[69],"precisely,":[70],"when":[71,127],"K":[72,78,128],">":[73],"T/":[74],"gcd(N,":[75],"T)":[76],"total":[81],"number":[82],"system":[87],"and":[88,104],"gcd(\u00b7,\u00b7)":[89],"means":[90,118],"greatest":[92],"common":[93,121],"divisor,":[94],"we":[95,131],"establish,":[96],"by":[97],"providing":[98],"both":[99],"a":[100,105,143],"novel":[101],"code":[102],"construction":[103],"matching":[106],"converse,":[107],"lcm(N":[113,149],"-T,":[114],"T),":[115],"lcm(\u00b7,\u00b7)":[117],"least":[120],"multiple.":[122],"On":[123],"other":[125],"hand,":[126],"small,":[130],"show":[132],"possible":[138],"design":[140],"even":[146],"smaller":[147],"-":[150],"T,":[151],"T).":[152]},"counts_by_year":[{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":6}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}