{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:46:32Z","timestamp":1742989592902,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030926403"},{"type":"electronic","value":"9783030926410"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-92641-0_1","type":"book-chapter","created":{"date-parts":[[2021,12,14]],"date-time":"2021-12-14T08:03:33Z","timestamp":1639469013000},"page":"3-15","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Batch Codes from Affine Cartesian Codes and Quotient Spaces"],"prefix":"10.1007","author":[{"given":"Travis Alan","family":"Baumbaugh","sequence":"first","affiliation":[]},{"given":"Haley","family":"Colgate","sequence":"additional","affiliation":[]},{"given":"Tim","family":"Jackman","sequence":"additional","affiliation":[]},{"given":"Felice","family":"Manganiello","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,15]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1109\/TIT.2018.2852294","volume":"65","author":"H Asi","year":"2019","unstructured":"Asi, H., Yaakobi, E.: Nearly optimal constructions of PIR and batch codes. IEEE Trans. Inf. Theory 65, 947\u2013964 (2019)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1_CR2","doi-asserted-by":"crossref","first-page":"153","DOI":"10.13069\/jacodesmath.466634","volume":"5","author":"T Baumbaugh","year":"2018","unstructured":"Baumbaugh, T., Diaz, Y., Friesenhahn, S., Manganiello, F., Vetter, A.: Batch codes from Hamming and Reed-Muller codes. J. Algebra Comb. Discrete Struct. Appl. 5, 153\u2013165 (2018)","journal-title":"J. Algebra Comb. Discrete Struct. Appl."},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.ffa.2018.01.006","volume":"51","author":"P Beelen","year":"2018","unstructured":"Beelen, P., Datta, M.: Generalized Hamming weights of affine Cartesian codes. Finite Fields Appl. 51, 130\u2013145 (2018)","journal-title":"Finite Fields Appl."},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"165","DOI":"10.3934\/amc.2012.6.165","volume":"6","author":"S Bhattacharya","year":"2012","unstructured":"Bhattacharya, S., Ruj, S., Roy, B.: Combinatorial batch codes: a lower bound and optimal constructions. Adv. Math. Commun. 6, 165\u2013174 (2012)","journal-title":"Adv. Math. Commun."},{"key":"1_CR5","first-page":"11","volume":"12","author":"C Bujt\u00e1s","year":"2011","unstructured":"Bujt\u00e1s, C., Tuza, Z.: Optimal combinatorial batch codes derived from dual systems, Miskolc. Math. Notes 12, 11\u201323 (2011)","journal-title":"Math. Notes"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1109\/JPROC.2010.2096170","volume":"99","author":"AG Dimakis","year":"2011","unstructured":"Dimakis, A.G., Ramchandran, K., Wu, Y., Suh, C.: A survey on network codes for distributed storage. Proc. IEEE 99, 476\u2013489 (2011)","journal-title":"Proc. IEEE"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1109\/18.651015","volume":"44","author":"P Heijnen","year":"1998","unstructured":"Heijnen, P., Pellikaan, R.: Generalized Hamming weights of $$q$$-ary Reed-Muller codes. IEEE Trans. Inform. Theory 44, 181\u2013196 (1998)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Holzbaur, L., Polyanskaya, R., Polyanskii, N., Vorobyev, I.: Lifted reed-solomon codes with application to batch codes. In: 2020 IEEE International Symposium on Information Theory (ISIT), pp. 634\u2013639 (2020)","DOI":"10.1109\/ISIT44484.2020.9174402"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Batch codes and their applications. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pp. 262\u2013271. ACM, New York (2004)","DOI":"10.1145\/1007352.1007396"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Li, R., Wootters, M.: Improved batch code lower bounds (2021)","DOI":"10.1109\/ISIT50566.2022.9834625"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.ffa.2019.01.004","volume":"57","author":"HH L\u00f3pez","year":"2019","unstructured":"L\u00f3pez, H.H., Manganiello, F., Matthews, G.L.: Affine Cartesian codes with complementary duals. Finite Fields Appl. 57, 13\u201328 (2019)","journal-title":"Finite Fields Appl."},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10623-012-9714-2","volume":"71","author":"HH L\u00f3pez","year":"2014","unstructured":"L\u00f3pez, H.H., Renter\u00eda-M\u00e1rquez, C., Villarreal, R.H.: Affine Cartesian codes. Des. Codes Cryptogr. 71, 5\u201319 (2014)","journal-title":"Des. Codes Cryptogr."},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"13","DOI":"10.3934\/amc.2009.3.13","volume":"3","author":"MB Paterson","year":"2009","unstructured":"Paterson, M.B., Stinson, D.R., Wei, R.: Combinatorial batch codes. Adv. Math. Commun. 3, 13\u201327 (2009)","journal-title":"Adv. Math. Commun."},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"7360","DOI":"10.1109\/TIT.2020.3013603","volume":"66","author":"R Polyanskaya","year":"2020","unstructured":"Polyanskaya, R., Polyanskii, N., Vorobyev, I.: Binary batch codes with improved redundancy. IEEE Trans. Inf. Theory 66, 7360\u20137370 (2020)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Ramakrishnan, P., Wootters, M.: On taking advantage of multiple requests in error correcting codes, CoRR, abs\/1802.00875 (2018)","DOI":"10.1109\/ISIT.2018.8437593"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Riet, A.-E., Skachek, V., Thomas, E.K.: Asynchronous Batch and PIR Codes from Hypergraphs, arXiv e-prints (2018)","DOI":"10.1109\/ITW.2018.8613518"},{"issue":"2","key":"1_CR17","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s10623-014-0007-9","volume":"78","author":"N Silberstein","year":"2014","unstructured":"Silberstein, N., G\u00e1l, A.: Optimal combinatorial batch codes based on block designs. Des. Codes Crypt. 78(2), 409\u2013424 (2014). https:\/\/doi.org\/10.1007\/s10623-014-0007-9","journal-title":"Des. Codes Crypt."},{"key":"1_CR18","series-title":"Signals and Communication Technology","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-319-70293-3_16","volume-title":"Network Coding and Subspace Designs","author":"V Skachek","year":"2018","unstructured":"Skachek, V.: Batch and PIR codes and their connections to locally repairable codes. In: Greferath, M., Pav\u010devi\u0107, M.O., Silberstein, N., V\u00e1zquez-Castro, M.\u00c1. (eds.) Network Coding and Subspace Designs. SCT, pp. 427\u2013442. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-70293-3_16"},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-319-66278-7_24","volume-title":"Coding Theory and Applications","author":"EK Thomas","year":"2017","unstructured":"Thomas, E.K., Skachek, V.: Constructions and bounds for batch codes with small parameters. In: Barbero, \u00c1.I., Skachek, V., Ytrehus, \u00d8. (eds.) ICMCTA 2017. LNCS, vol. 10495, pp. 283\u2013295. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66278-7_24"}],"container-title":["Lecture Notes in Computer Science","Cryptography and Coding"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92641-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,14]],"date-time":"2024-09-14T10:41:56Z","timestamp":1726310516000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92641-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030926403","9783030926410"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92641-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"15 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IMACC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IMA International Conference on Cryptography and Coding","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ima2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ima.org.uk\/11167\/17th-ima-international-conference-on-cryptography-and-coding\/","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":"30","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":"14","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":"47% - 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":"3","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":"5","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)"}}]}}