{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:23:03Z","timestamp":1742919783661,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030705718"},{"type":"electronic","value":"9783030705725"}],"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-70572-5_16","type":"book-chapter","created":{"date-parts":[[2021,3,3]],"date-time":"2021-03-03T07:03:53Z","timestamp":1614755033000},"page":"253-268","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Normalized Comparison Method for Finding the Most Efficient DSS Code"],"prefix":"10.1007","author":[{"given":"Natasa","family":"Paunkoska","sequence":"first","affiliation":[]},{"given":"Ninoslav","family":"Marina","sequence":"additional","affiliation":[]},{"given":"Weiler","family":"Finamore","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,3,4]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","DOI":"10.1002\/0471739219","volume-title":"Error Correction Coding: Mathematical Methods and Algorithms","author":"TK Moon","year":"2005","unstructured":"Moon, T.K.: Error Correction Coding: Mathematical Methods and Algorithms. Wiley-Interscience, Hoboken (2005)"},{"key":"16_CR2","volume-title":"The Theory of Error-Correcting Codes","author":"FJ MacWilliams","year":"1983","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North Holland Mathematical Library, Amsterdam, The Netherlands (1983)"},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"6506","DOI":"10.1109\/TIT.2018.2810095","volume":"64","author":"AS Rawat","year":"2018","unstructured":"Rawat, A.S., Tamo, I., Guruswami, V., Efremenko, K.: MDS code constructions with small sub-packetization and near-optimal repair bandwidth. Trans. Inf. Theory IEEE 64, 6506\u20136525 (2018)","journal-title":"Trans. Inf. Theory IEEE"},{"key":"16_CR4","first-page":"5684","volume":"63","author":"V Guruswami","year":"2017","unstructured":"Guruswami, V., Wootters, M.: Repairing Reed-Solomon codes. Trans. Inf. Theory IEEE 63, 5684\u20135698 (2017)","journal-title":"Trans. Inf. Theory IEEE"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Weatherspoon, H., Kubiatowicz, J.: Erasure coding vs. replication: a quantitative comparison. In: Proceedings of 1st International Workshop Peer-to-Peer System (IPTPS), pp. 328\u2013338 (2001)","DOI":"10.1007\/3-540-45748-8_31"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"325","DOI":"10.14778\/2535573.2488339","volume":"6","author":"M Sathiamoorthy","year":"2013","unstructured":"Sathiamoorthy, M., et al.: Xoring elephants: Novel erasure codes for big data. Proc. VLDB Endow. 6, 325\u2013336 (2013)","journal-title":"Proc. VLDB Endow."},{"key":"16_CR7","unstructured":"Memorandum of understanding for the implementation of the COST Action, European Cooperation for Statistics of Network Data Science (2015)"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Dimakis*, A.G., Prabhakaran, V., Ramchandran, K.: Decentralized erasure code for distributed storage. Trans. Inf. Theory IEEE\/ACM Netw., (2006)","DOI":"10.1109\/TIT.2006.874535"},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1109\/TIT.2013.2288784","volume":"60","author":"AS Rawat","year":"2013","unstructured":"Rawat, A.S., Koyluoglu, O.O., Silberstein, N., Vishwanath, S.: Optimal locally repairable and secure codes for distributed storage system. Info. Theory IEEE Trans. 60, 212\u2013236 (2013)","journal-title":"Info. Theory IEEE Trans."},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Rashmi, K.V., Shah, N.B., Kumar, P.V.: Regenerating codes for errors and erasures in distributed storage. In: Proceedings of IEEE International Symposium on Information Theory (ISIT) (2012)","DOI":"10.1109\/ISIT.2012.6283046"},{"issue":"8","key":"16_CR11","doi-asserted-by":"publisher","first-page":"5227","DOI":"10.1109\/TIT.2011.2159049","volume":"57","author":"AG Dimakis","year":"2011","unstructured":"Dimakis, A.G., Godfrey, P.B., Wu, Y., Wainright, M.J., Ramchandran, K.: Network coding for distributed storage systems. IEEE Trans. Inf. Theory 57(8), 5227\u20135239 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Dimakis, A.G., Godfrey, P.B., Wainright, M., Ramchadran, K.: Network coding for distributed storage systems. In: Proceedings of 26th IEEE International Conference on Computer Communications, Anchorage, AK, pp. 2000\u20132008, May 2007","DOI":"10.1109\/INFCOM.2007.232"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Han, Y.S., Zheng, R., Mow, W.H.: Exact regenerating codes for byzantine fault tolerance in distributed storage. In: INFOCOM Proceedings, pp. 2498\u20132506 (2012)","DOI":"10.1109\/INFCOM.2012.6195641"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Han, Y.S., Pai, H.T., Zheng, R., Varshney, P.K.: Update-efficient regenerating codes with minimum per-node storage. In: Information Theory Proceedings (ISIT), pp. 1436\u201314406 (2013)","DOI":"10.1109\/ISIT.2013.6620464"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Goparaju, S., Tamo, I., Calderbank, R.: An improved sub-packetization bound for minimum storage regenerating codes. IEEE Information Theory Transactions, pp. 2770\u20132779 (2014)","DOI":"10.1109\/TIT.2014.2309000"},{"issue":"8","key":"16_CR16","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(8), 5227\u20135239 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Paunkoska, N., Finamore, W., Karamachoski, J., Puncheva, M., Marina, N.: Improving DSS Efficiency with Shortened MSR Codes. ICUMT (2016)","DOI":"10.1109\/ICUMT.2016.7765367"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Paunkoska, N., Finamore, W., Marina, N.: Fair Comparison of DSS Codes. In: Future of Information and Communication Conference (FICC 2018) (2018)","DOI":"10.1007\/978-3-030-03402-3_6"},{"key":"16_CR19","unstructured":"Vajha, M., et al.: Clay codes: moulding MDS codes to yield an MSR code. In: Proceedings of the 16th USENIX Conference on File and Storage Technologies (FAST 2018), USENIX Association, USA, pp. 139\u2013153 (2018)"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Towards new e-Infrastructure and e-Services for Developing Countries"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-70572-5_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T07:13:41Z","timestamp":1619766821000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-70572-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030705718","9783030705725"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-70572-5_16","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"4 March 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AFRICOMM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on e-Infrastructure and e-Services for Developing Countries","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Eb\u00e8ne","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mauritius","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"africom2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/africommconference.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":"ConfyPlus","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"89","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":"20","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":"22% - 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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to COVID-19 pandemic the conference was held virtually.","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)"}}]}}