{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:39:45Z","timestamp":1742949585032,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030170646"},{"type":"electronic","value":"9783030170653"}],"license":[{"start":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T00:00:00Z","timestamp":1554854400000},"content-version":"tdm","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":[[2020]]},"DOI":"10.1007\/978-3-030-17065-3_23","type":"book-chapter","created":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T01:38:22Z","timestamp":1554773902000},"page":"226-237","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient and Secure Forward Error Correcting Scheme for DNA Data Storage"],"prefix":"10.1007","author":[{"given":"Anouar","family":"Yatribi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mostafa","family":"Belkasmi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fouad","family":"Ayoub","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,10]]},"reference":[{"unstructured":"Reinsel, D., Gantz, J., Rydning, J.: Data age 2025: the evolution of data to life-critical. Don\u2019t Focus on Big Data (2017)","key":"23_CR1"},{"issue":"5210","key":"23_CR2","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1126\/science.7725109","volume":"268","author":"EB Baum","year":"1995","unstructured":"Baum, E.B.: Building an associative memory vastly larger than the brain. Science 268(5210), 583\u2013585 (1995)","journal-title":"Science"},{"issue":"7435","key":"23_CR3","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1038\/nature11875","volume":"494","author":"N Goldman","year":"2013","unstructured":"Goldman, N., Bertone, P., Chen, S., Dessimoz, C., LeProust, E.M., Sipos, B., Birney, E.: Towards practical, high-capacity, low maintenance information storage in synthesized DNA. Nature 494(7435), 77 (2013)","journal-title":"Nature"},{"issue":"6102","key":"23_CR4","doi-asserted-by":"publisher","first-page":"1628","DOI":"10.1126\/science.1226355","volume":"337","author":"GM Church","year":"2012","unstructured":"Church, G.M., Gao, Y., Kosuri, S.: Next generation digital information storage in DNA. Science 337(6102), 1628 (2012)","journal-title":"Science"},{"doi-asserted-by":"crossref","unstructured":"Limbachiya, D., Dhameliya, V., Khakhar, M., Gupta, M.K.: On optimal family of codes for archival DNA storage. arXiv preprint \n                  arXiv:1501.07133\n                  \n                 (2015)","key":"23_CR5","DOI":"10.1109\/IWSDA.2015.7458386"},{"issue":"8","key":"23_CR6","doi-asserted-by":"publisher","first-page":"2552","DOI":"10.1002\/anie.201411378","volume":"54","author":"RN Grass","year":"2015","unstructured":"Grass, R.N., Heckel, R., Puddu, M., Paunescu, D., Stark, W.J.: Robust chemical preservation of digital information on DNA in silica with error-correcting codes. Angew. Chem. Int. Ed. 54(8), 2552\u20132555 (2015)","journal-title":"Angew. Chem. Int. Ed."},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.1016\/j.procs.2016.05.398","volume":"80","author":"M Blawat","year":"2016","unstructured":"Blawat, M., Gaedke, K., Hutter, I., Chen, X.-M., Turczyk, B., Inverso, S., Pruitt, B.W., Church, G.M.: Forward error correction for DNA data storage. Procedia Compute. Sci. 80, 1011\u20131022 (2016)","journal-title":"Procedia Compute. Sci."},{"issue":"2","key":"23_CR8","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/2954680.2872397","volume":"50","author":"J Bornholt","year":"2016","unstructured":"Bornholt, J., Lopez, R., Carmean, D.M., Ceze, L., Seelig, G., Strauss, K.: A DNA based archival storage system. ACM SIGOPS Oper. Syst. Rev. 50(2), 637\u2013649 (2016)","journal-title":"ACM SIGOPS Oper. Syst. Rev."},{"doi-asserted-by":"crossref","unstructured":"Jain, S., Hassanzadeh, F.F., Schwartz, M., Bruck, J.: Duplication-correcting codes for data storage in the DNA of living organisms. In: 2016 IEEE International Symposium on Information Theory (ISIT), pp. 1028\u20131032. IEEE (2016)","key":"23_CR9","DOI":"10.1109\/ISIT.2016.7541455"},{"issue":"6328","key":"23_CR10","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1126\/science.aaj2038","volume":"355","author":"Y Erlich","year":"2017","unstructured":"Erlich, Y., Zielinski, D.: DNA fountain enables a robust and efficient storage architecture. Science 355(6328), 950\u2013954 (2017)","journal-title":"Science"},{"unstructured":"Erlich, Y., Zielinski, D.: Capacity-approaching DNA storage. bioRxiv, pp. 074237 (2016)","key":"23_CR11"},{"issue":"1","key":"23_CR12","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1186\/1471-2105-8-176","volume":"8","author":"D Heider","year":"2007","unstructured":"Heider, D., Barnekow, A.: DNA-based watermarks using the dna-crypt algorithm. BMC Bioinf. 8(1), 176 (2007)","journal-title":"BMC Bioinf."},{"issue":"7","key":"23_CR13","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1002\/j.1538-7305.1966.tb01686.x","volume":"45","author":"EJ Weldon Jr","year":"1966","unstructured":"Weldon Jr., E.J.: Difference-set cyclic codes. Bell Syst. Tech. J. 45(7), 1045\u20131055 (1966)","journal-title":"Bell Syst. Tech. J."},{"unstructured":"Rudolph, L.D.: Geometric configurations and majority logic decodable codes. Ph.D. thesis, MEE-University of Oklahoma (1964)","key":"23_CR14"},{"issue":"6","key":"23_CR15","doi-asserted-by":"publisher","first-page":"931","DOI":"10.1109\/26.848552","volume":"48","author":"R Lucas","year":"2000","unstructured":"Lucas, R., Fossorier, M.P.C., Kou, Y., Lin, S.: Iterative decoding of one-step majority logic decodable codes based on belief propagation. IEEE Trans. Commun. 48(6), 931\u2013937 (2000)","journal-title":"IEEE Trans. Commun."},{"issue":"7","key":"23_CR16","doi-asserted-by":"publisher","first-page":"2711","DOI":"10.1109\/18.959255","volume":"47","author":"Y Kou","year":"2001","unstructured":"Kou, Y., Lin, S., Fossorier, M.P.C.: Low-density parity-check codes based on finite geometries: a rediscovery and new results. IEEE Trans. Inf. Theor. 47(7), 2711\u20132736 (2001)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"3","key":"23_CR17","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1090\/S0002-9947-1938-1501951-4","volume":"43","author":"J Singer","year":"1938","unstructured":"Singer, J.: A theorem in finite projective geometry and some applications to number theory. Trans. Am. Math. Soc. 43(3), 377\u2013385 (1938)","journal-title":"Trans. Am. Math. Soc."},{"unstructured":"Shu, L., Costello, D.J.: Error Control Coding. The Second International edition, Prentice-Hall, pp. 704\u2013712 (2004)","key":"23_CR18"},{"key":"23_CR19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511803253","volume-title":"Channel Codes: Classicaland Modern","author":"W Ryan","year":"2009","unstructured":"Ryan, W., Lin, S.: Channel Codes: Classicaland Modern. Cambridge University Press, Cambridge (2009)"}],"container-title":["Advances in Intelligent Systems and Computing","Proceedings of the Tenth International Conference on Soft Computing and Pattern Recognition (SoCPaR 2018)"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17065-3_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T04:11:52Z","timestamp":1558152712000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-17065-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,10]]},"ISBN":["9783030170646","9783030170653"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17065-3_23","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2019,4,10]]},"assertion":[{"value":"10 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SoCPaR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Soft Computing and Pattern Recognition","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"socpar2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.mirlabs.net\/socpar18\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}