{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T10:07:46Z","timestamp":1761646066982,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319662770"},{"type":"electronic","value":"9783319662787"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","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":[[2017]]},"DOI":"10.1007\/978-3-319-66278-7_23","type":"book-chapter","created":{"date-parts":[[2017,8,22]],"date-time":"2017-08-22T09:34:12Z","timestamp":1503394452000},"page":"272-282","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A New Construction of Minimum Distance Robust Codes"],"prefix":"10.1007","author":[{"given":"Hila","family":"Rabii","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Osnat","family":"Keren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,23]]},"reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/BFb0052259","volume-title":"Advances in Cryptology \u2014 CRYPTO 1997","author":"E Biham","year":"1997","unstructured":"Biham, E., Shamir, A.: Differential fault analysis of secret key cryptosystems. In: Kaliski, B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 513\u2013525. Springer, Heidelberg (1997). doi:10.1007\/BFb0052259"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Tomashevich, V., Neumeier, Y., Kumar, R., Keren, O., Polian, I.: Protecting cryptographic hardware against malicious attacks by nonlinear robust codes. In: 2014 IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems (DFT), pp. 40\u201345. IEEE (2014)","DOI":"10.1109\/DFT.2014.6962084"},{"volume-title":"Secure Integrated Circuits and Systems","year":"2010","key":"23_CR3","unstructured":"Verbauwhede, I.M. (ed.): Secure Integrated Circuits and Systems. Springer, New York (2010)"},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-540-78967-3_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"R Cramer","year":"2008","unstructured":"Cramer, R., Dodis, Y., Fehr, S., Padr\u00f3, C., Wichs, D.: Detection of algebraic manipulation with applications to robust secret sharing and fuzzy extractors. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 471\u2013488. Springer, Heidelberg (2008). doi:10.1007\/978-3-540-78967-3_27"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Wang, Z., Karpovsky, M.: Algebraic manipulation detection codes and their applications for design of secure cryptographic devices. In: 2011 IEEE 17th International on On-Line Testing Symposium (IOLTS), pp. 234\u2013239. IEEE (2011)","DOI":"10.1109\/IOLTS.2011.5994535"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Ngo, X.T., Bhasin, S., Danger, J., Guilley, S., Najm, Z.: Linear complementary dual code improvement to strengthen encoded circuit against hardware Trojan Horses. In: IEEE International Symposium on Hardware Oriented Security and Trust, HOST 2015, Washington, DC, USA, 5\u20137 May 2015, pp. 82\u201387 (2015)","DOI":"10.1109\/HST.2015.7140242"},{"key":"23_CR7","unstructured":"Dziembowski, S., Pietrzak, K., Wichs, D.: Non-malleable codes. Cryptology ePrint Archive, Report 2009\/608 (2009). http:\/\/eprint.iacr.org\/2009\/608"},{"issue":"1","key":"23_CR8","first-page":"206","volume":"63","author":"O Keren","year":"2015","unstructured":"Keren, O., Karpovsky, M.: Relations between the entropy of a source and the error masking probability for security-oriented codes. IEEE Trans. Commun. 63(1), 206\u2013214 (2015)","journal-title":"IEEE Trans. Commun."},{"key":"23_CR9","unstructured":"Karpovsky, M.G., Kulikowski, K.J., Wang, Z.: Robust error detection in communication and computational channels. In: International Workshop on Spectral Methods and Multirate Signal Processing, SMMSP 2007, Citeseer (2007)"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Admaty, N., Litsyn, S., Keren, O.: Puncturing, expurgating and expanding the q-ary BCH based robust codes. In: 2012 IEEE 27th Convention of Electrical Electronics Engineers in Israel (IEEEI), pp. 1\u20135, November 2012","DOI":"10.1109\/EEEI.2012.6376995"},{"issue":"5","key":"23_CR11","doi-asserted-by":"publisher","first-page":"2813","DOI":"10.1109\/TIT.2014.2310464","volume":"60","author":"Y Neumeier","year":"2014","unstructured":"Neumeier, Y., Keren, O.: Robust generalized punctured cubic codes. IEEE Trans. Inf. Theory 60(5), 2813\u20132822 (2014)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"23_CR12","unstructured":"Rabii, H., Neumeier, Y., Keren, O.: Low complexity high rate robust codes derived from the quadratic-sum code. In: 12th International Workshop on Boolean Problems (2016)"},{"issue":"12","key":"23_CR13","doi-asserted-by":"publisher","first-page":"8007","DOI":"10.1109\/TIT.2011.2162718","volume":"57","author":"S Engelberg","year":"2011","unstructured":"Engelberg, S., Keren, O.: A comment on the karpovsky-taubin code. IEEE Trans. Inf. Theory 57(12), 8007\u20138010 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Neumeier, Y., Keren, O.: A new efficiency criterion for security oriented error correcting codes. In: 2014 19th IEEE European Test Symposium (ETS), pp. 1\u20136. IEEE (2014)","DOI":"10.1109\/ETS.2014.6847800"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Wang, Z., Karpovsky, M.G., Kulikowski, K.J.: Replacing linear hamming codes by robust nonlinear codes results in a reliability improvement of memories. In: IEEE\/IFIP International Conference on Dependable Systems & Networks, DSN 2009, pp. 514\u2013523. IEEE (2009)","DOI":"10.1109\/DSN.2009.5270297"},{"issue":"5","key":"23_CR16","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/s10836-010-5168-5","volume":"26","author":"Z Wang","year":"2010","unstructured":"Wang, Z., Karpovsky, M., Kulikowski, K.J.: Design of memories with concurrent error detection and correction by nonlinear SEC-DED codes. J. Electron. Test. 26(5), 559\u2013580 (2010)","journal-title":"J. Electron. Test."}],"container-title":["Lecture Notes in Computer Science","Coding Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-66278-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:06:03Z","timestamp":1710345963000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-66278-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319662770","9783319662787"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66278-7_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"23 August 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICMCTA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Castle Meeting on Coding Theory and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vihula","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Estonia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icmcta2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.castle-meeting-2017.ut.ee\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}