{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T08:46:32Z","timestamp":1770972392880,"version":"3.50.1"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030678982","type":"print"},{"value":"9783030678999","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/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":"http:\/\/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-67899-9_30","type":"book-chapter","created":{"date-parts":[[2021,1,28]],"date-time":"2021-01-28T00:05:55Z","timestamp":1611792355000},"page":"373-384","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Recursive Methods for Some Problems in Coding and Random Permutations"],"prefix":"10.1007","author":[{"given":"Ghurumuruhan","family":"Ganesan","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,28]]},"reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"1567","DOI":"10.1214\/aop\/1176989707","volume":"20","author":"R Arratia","year":"1992","unstructured":"Arratia, R., Tavar\u00e9, S.: The cycle structure of random permutations. Ann. Probab. 20, 1567\u20131591 (1992)","journal-title":"Ann. Probab."},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Balaji, S.B., Krishnan, M.N., Vajha, M., Ramkumar, V., Sasidharan, B., Kumar, P.V.: Erasure coding for distributed storage: an overview. Sci. China Inf. Sci. 61 (2018)","DOI":"10.1007\/s11432-018-9482-6"},{"key":"30_CR3","doi-asserted-by":"publisher","first-page":"427","DOI":"10.30757\/ALEA.v14-23","volume":"14","author":"V Betz","year":"2017","unstructured":"Betz, V., Sch\u00e4fer, H.: The number of cycles in random permutations without long cycles is asymptotically Gaussian, ALEA. Lat. Am. J. Probab. Stat. 14, 427\u2013444 (2017)","journal-title":"Lat. Am. J. Probab. Stat."},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"441","DOI":"10.4086\/toc.2013.v009a013","volume":"9","author":"A Bhaskara","year":"2013","unstructured":"Bhaskara, A., Desai, D., Srinivasan, S.: Optimal hitting sets for combinatorial shapes. Theory Comput. 9, 441\u2013470 (2013)","journal-title":"Theory Comput."},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.disc.2014.01.016","volume":"324","author":"M Forbes","year":"2014","unstructured":"Forbes, M., Yekhanin, S.: On the locality of codeword symbols in non-linear codes. Discrete Math. 324, 78\u201384 (2014)","journal-title":"Discrete Math."},{"key":"30_CR6","first-page":"1","volume":"19","author":"V Gon\u010darov","year":"1962","unstructured":"Gon\u010darov, V.: On the field of combinatory analysis. Am. Math. Soc. Trans. 19, 1\u201346 (1962)","journal-title":"Am. Math. Soc. Trans."},{"key":"30_CR7","doi-asserted-by":"publisher","first-page":"6925","DOI":"10.1109\/TIT.2012.2208937","volume":"58","author":"P Gopalan","year":"2012","unstructured":"Gopalan, P., Huang, C., Simitci, H., Yekhanin, S.: On the locality of codeword symbols. IEEE Trans. Inf. Theory 58, 6925\u20136934 (2012)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"30_CR8","unstructured":"Graham, R., Knuth D., Patashnik, O.: Concrete Mathematics. Addison-Wesley, Boston (1989)"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Huffman, W.C., Pless, V.: Fundamentals of Error Correcting Codes. Cambridge University Press, Cambridge (2003)","DOI":"10.1017\/CBO9780511807077"},{"key":"30_CR10","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1109\/18.661507","volume":"44","author":"MG Karpovsky","year":"1998","unstructured":"Karpovsky, M.G., Chakrabarty, K., Levitin, L.B.: On a new class of codes for identifying vertices in graphs. IEEE Trans. Inf. Theory 44, 599\u2013611 (1998)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"30_CR11","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01200907","volume":"17","author":"N Linial","year":"1997","unstructured":"Linial, N., Luby, M., Saks, M., Zuckerman, D.: Efficient construction of a small hitting set for combinatorial rectangles in high dimension. Combinatorica 17, 215\u2013234 (1997)","journal-title":"Combinatorica"},{"key":"30_CR12","doi-asserted-by":"publisher","first-page":"5227","DOI":"10.1109\/TIT.2011.2159049","volume":"57","author":"KV Rashmi","year":"2011","unstructured":"Rashmi, K.V., Shah, N.B., Kumar, P.V.: Optimal exact-regenerating codes for distributed storage at the MSR and MBR points via a product-matrix construction. IEEE Trans. Inf. Theory 57, 5227\u20135239 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"30_CR13","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1090\/S0002-9947-1966-0195117-8","volume":"121","author":"LA Shepp","year":"1966","unstructured":"Shepp, L.A., Lloyd, S.P.: Ordered cycle lengths in a random permutation. Trans. Am. Math. Soc. 121, 340\u2013357 (1966)","journal-title":"Trans. Am. Math. Soc."},{"key":"30_CR14","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0020-0190(02)00475-1","volume":"86","author":"L Sunil Chandran","year":"2003","unstructured":"Sunil Chandran, L.: A lower bound for the hitting set size for combinatorial rectangles and an application. Inf. Process. Lett. 86, 75\u201378 (2003)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-67899-9_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,28]],"date-time":"2021-01-28T00:12:53Z","timestamp":1611792773000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-67899-9_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030678982","9783030678999"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-67899-9_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"28 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rupnagar","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 February 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 February 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iitrpr.ac.in\/caldam2021\/index.html","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 and OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"82","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":"39","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":"48% - 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,8","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":"2,21","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)"}}]}}