{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:03:56Z","timestamp":1743055436459,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031229435"},{"type":"electronic","value":"9783031229442"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-22944-2_10","type":"book-chapter","created":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T18:03:58Z","timestamp":1673373838000},"page":"169-182","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["PIR Codes from\u00a0Combinatorial Structures"],"prefix":"10.1007","author":[{"given":"Massimo","family":"Giulietti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arianna","family":"Sabatini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Timpanella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,11]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0012-365X(76)90025-X","volume":"15","author":"RD Baker","year":"1976","unstructured":"Baker, R.D.: Partitioning the planes of $${\\rm {AG}}_{2m}(2)$$ into $$2$$-designs. Discret. Math. 15, 205\u2013211 (1976)","journal-title":"Discret. Math."},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/BF00181359","volume":"3","author":"A Beutelspacher","year":"1974","unstructured":"Beutelspacher, A.: On parallelisms in finite projective spaces. Geom. Dedicata. 3, 35\u201340 (1974)","journal-title":"Geom. Dedicata."},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s00233-011-9343-5","volume":"84","author":"M Bras-Amor\u00f3s","year":"2012","unstructured":"Bras-Amor\u00f3s, M., Stokes, K.: The semigroup of combinatorial configurations. Semigroup Forum 84, 91\u201396 (2012)","journal-title":"Semigroup Forum"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10801-020-01001-x","volume":"55","author":"M Buratti","year":"2022","unstructured":"Buratti, M., Stinson, D.R.: On resolvable Golomb rulers, symmetric configurations and progressive dinner parties. J. Algebraic Combin. 55, 141\u2013156 (2022)","journal-title":"J. Algebraic Combin."},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Colbourn, C.J., Dinitz, J.H.: Handbook of Combinatorial Designs, Discrete Mathematics and Its Applications, Second Edition, Chapman & Hall\/CRC (2007)","DOI":"10.1201\/9781420010541"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10623-015-0070-x","volume":"80","author":"AA Davydov","year":"2016","unstructured":"Davydov, A.A., Faina, G., Giulietti, M., Marcugini, S., Pambianco, F.: On constructions and parameters of symmetric configurations $$v_k$$. Des. Codes Cryptogr. 80, 125\u2013147 (2016)","journal-title":"Des. Codes Cryptogr."},{"issue":"3","key":"10_CR7","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/s10623-020-00828-6","volume":"89","author":"S Kurz","year":"2021","unstructured":"Kurz, S., Yaakobi, E.: PIR codes with short block length. Des. Codes Crypt. 89(3), 559\u2013587 (2021). https:\/\/doi.org\/10.1007\/s10623-020-00828-6","journal-title":"Des. Codes Crypt."},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Fazeli, A., Vardy, A., Yaakobi, E.: Codes for distributed PIR with low storage overhead. In: 2015 IEEE International Symposium on Information Theory (ISIT), pp. 2852\u20132856 (2015)","DOI":"10.1109\/ISIT.2015.7282977"},{"key":"10_CR9","unstructured":"Fazeli, A., Vardy, A., Yaakobi, E.: PIR with low storage overhead: coding instead of replication. arXiv:1505.06241 (2015)"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/j.dam.2019.02.019","volume":"266","author":"G G\u00e9vay","year":"2019","unstructured":"G\u00e9vay, G.: Resolvable configurations. Discret. Appl. Math. 266, 319\u2013330 (2019)","journal-title":"Discret. Appl. Math."},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Gezek, M., Mathon, R., Tonchev, V.D.: Maximal arcs, codes, and new links between projective planes of order 16. Electron. J. Combinat. 27 (2020)","DOI":"10.37236\/9008"},{"issue":"1","key":"10_CR12","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s00493-009-2225-8","volume":"29","author":"M Giulietti","year":"2009","unstructured":"Giulietti, M.: Line partitions of internal points to a conic in $${\\rm {PG}}(2, q)$$. Combinatorica 29(1), 19\u201325 (2009)","journal-title":"Combinatorica"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0012-365X(94)90087-6","volume":"124","author":"H Gropp","year":"1994","unstructured":"Gropp, H.: Non-symmetric configurations with natural index. Discrete Math. 124, 87\u201398 (1994)","journal-title":"Discrete Math."},{"key":"10_CR14","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198502951.001.0001","volume-title":"Projective Geometries Over Finite Fields","author":"JWP Hirschfeld","year":"1998","unstructured":"Hirschfeld, J.W.P.: Projective Geometries Over Finite Fields, 2nd edn. Oxford Univ. Press, Oxford (1998)","edition":"2"},{"key":"10_CR15","unstructured":"Lin, H.Y., Rosnes, E.: Lengthening and extending binary private information retrieval codes. In: International Zurich Seminar on Information and Communication, pp. 113\u2013117 (2018)"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Skachek, V.: Batch and PIR codes and their connections to locally repairable codes, Network Coding and Subspace Designs, Cham, Switzerland, pp. 427\u2013442 (2018)","DOI":"10.1007\/978-3-319-70293-3_16"}],"container-title":["Lecture Notes in Computer Science","Arithmetic of Finite Fields"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22944-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,4]],"date-time":"2023-12-04T11:09:40Z","timestamp":1701688180000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22944-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031229435","9783031229442"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22944-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"11 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAIFI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on the Arithmetic of Finite Fields","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waifi2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/waifi.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"76% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3 (invited papers from invited speakers)","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}