{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T03:22:27Z","timestamp":1776396147443,"version":"3.51.2"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319662770","type":"print"},{"value":"9783319662787","type":"electronic"}],"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_16","type":"book-chapter","created":{"date-parts":[[2017,8,22]],"date-time":"2017-08-22T09:34:12Z","timestamp":1503394452000},"page":"192-206","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On Quasi-Abelian Complementary Dual Codes"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1076-0866","authenticated-orcid":false,"given":"Somphong","family":"Jitman","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7407-2539","authenticated-orcid":false,"given":"Herbert S.","family":"Palines","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3563-2262","authenticated-orcid":false,"given":"Romar B.","family":"dela Cruz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,23]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"3210","DOI":"10.1109\/TIT.2006.876244","volume":"52","author":"LMJ Bazzi","year":"2006","unstructured":"Bazzi, L.M.J., Mitter, S.K.: Some randomized code constructions from group actions. IEEE Trans. Inf. Theory 52, 3210\u20133219 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W Bosma","year":"1997","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system I: the user language. J. Symb. Comput. 24, 235\u2013265 (1997)","journal-title":"J. Symb. Comput."},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-319-17296-5_9","volume":"3","author":"C Carlet","year":"2015","unstructured":"Carlet, C., Guilley, S.: Complementary dual codes for countermeasures to side-channel attacks. Coding Theor. Appl. 3, 97\u2013105 (2015)","journal-title":"Coding Theor. Appl."},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Carlet, C., Daif, A., Danger, J.L., Guilley, S., Najm, Z., Ngo, X.T., Portebouef, T., Tavernier, C.: Optimized linear complementary codes implementation for hardware trojan prevention. In: Proceedings of European Conference on Circuit Theory and Design, 24\u201326 August 2015, Trondheim, Norway. IEEE, Piscataway (2015)","DOI":"10.1109\/ECCTD.2015.7300075"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"1794","DOI":"10.1109\/TIT.2004.831855","volume":"50","author":"BK Dey","year":"2004","unstructured":"Dey, B.K.: On existence of good self-dual quasi-cyclic codes. IEEE Trans. Inform. Theory 50, 1794\u20131798 (2004)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0895480102416192","volume":"18","author":"BK Dey","year":"2004","unstructured":"Dey, B.K., Rajan, B.S.: Codes closed under arbitrary abelian group of permutations. SIAM J. Discrete Math. 18, 1\u201318 (2004)","journal-title":"SIAM J. Discrete Math."},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1109\/18.825811","volume":"46","author":"C Ding","year":"2000","unstructured":"Ding, C., Kohel, D.R., Ling, S.: Split group codes. IEEE Trans. Inform. Theory 46, 485\u2013495 (2000)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/j.ffa.2009.01.002","volume":"15","author":"M Esmaeili","year":"2009","unstructured":"Esmaeili, M., Yari, S.: On complementary-dual quasi-cylic codes. Finite Fields Their Appl. 15, 375\u2013386 (2009)","journal-title":"Finite Fields Their Appl."},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Etesami, J., Hu, F., Henkel, W.: LCD codes and iterative decoding by projections, a first step towards an intuitive description of iterative decoding. In: Proceedings of IEEE Globecom, 5\u20139 December 2011, Texas, USA. IEEE, Piscataway (2011)","DOI":"10.1109\/GLOCOM.2011.6133942"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1109\/TIT.2014.2368138","volume":"61","author":"Y Fan","year":"2015","unstructured":"Fan, Y., Lin, L.: Thresholds of random quasi-abelian codes. IEEE Trans. Inform. Theory 61, 82\u201390 (2015)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.ffa.2016.07.005","volume":"42","author":"C Guneri","year":"2016","unstructured":"Guneri, C., Ozkaya, B., Sol\u00e9, P.: Quasi-cylic complementary dual codes. Finite Fields Their Appl. 42, 67\u201380 (2016)","journal-title":"Finite Fields Their Appl."},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-540-45146-4_27","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"Y Ishai","year":"2003","unstructured":"Ishai, Y., Sahai, A., Wagner, D.: Private circuits: securing hardware against probing attacks. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 463\u2013481. Springer, Heidelberg (2003). doi:10.1007\/978-3-540-45146-4_27"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"3046","DOI":"10.1109\/TIT.2012.2236383","volume":"59","author":"S Jitman","year":"2013","unstructured":"Jitman, S., Ling, S., Liu, H., Xie, X.: Abelian codes in principal ideal group algebras. IEEE Trans. Inform. Theory 59, 3046\u20133058 (2013)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/s10623-013-9878-4","volume":"74","author":"S Jitman","year":"2015","unstructured":"Jitman, S., Ling, S.: Quasi-abelian codes. Des. Codes Crypt. 74, 511\u2013531 (2015)","journal-title":"Des. Codes Crypt."},{"key":"16_CR15","doi-asserted-by":"publisher","first-page":"1496","DOI":"10.1109\/TIT.2013.2296495","volume":"60","author":"S Jitman","year":"2014","unstructured":"Jitman, S., Ling, S., Sol\u00e9, P.: Hermitian self-dual abelian codes. IEEE Trans. Inform. Theory 60, 1496\u20131507 (2014)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"16_CR16","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0166-218X(00)00350-4","volume":"111","author":"K Lally","year":"2001","unstructured":"Lally, K., Fitzpatrick, P.: Algebraic structure of quasicyclic codes. Discrete Appl. Math. 111, 157\u2013175 (2001)","journal-title":"Discrete Appl. Math."},{"key":"16_CR17","doi-asserted-by":"publisher","first-page":"2751","DOI":"10.1109\/18.959257","volume":"47","author":"S Ling","year":"2001","unstructured":"Ling, S., Sol\u00e9, P.: On the algebraic structure of quasi-cyclic codes I: finite fields. IEEE Trans. Inform. Theory 47, 2751\u20132760 (2001)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"16_CR18","doi-asserted-by":"publisher","first-page":"1052","DOI":"10.1109\/TIT.2003.809501","volume":"49","author":"S Ling","year":"2003","unstructured":"Ling, S., Sol\u00e9, P.: Good self-dual quasi-cyclic codes exist. IEEE Trans. Inform. Theory 49, 1052\u20131053 (2003)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"16_CR19","doi-asserted-by":"publisher","first-page":"2692","DOI":"10.1109\/TIT.2005.850142","volume":"51","author":"S Ling","year":"2005","unstructured":"Ling, S., Sol\u00e9, P.: On the algebraic structure of quasi-cyclic codes III: generator theory. IEEE Trans. Inform. Theory 51, 2692\u20132700 (2005)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"16_CR20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511755279","volume-title":"Coding Theory, A First Course","author":"S Ling","year":"2004","unstructured":"Ling, S., Xing, C.: Coding Theory, A First Course. Cambridge University Press, New York (2004)"},{"issue":"107","key":"16_CR21","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/0012-365X(92)90563-U","volume":"106","author":"JL Massey","year":"1992","unstructured":"Massey, J.L.: Linear codes with complementary duals. Discrete Math. 106(107), 337\u2013342 (1992)","journal-title":"Discrete Math."},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Ngo, X.T., Guilley, S., Bhasin, S., Danger, J.L., Najm, Z.: Encoding the state of integrated circuits: a proactive and reactive protection against hardware trojans horses. In: Proceedings of WESS 2014, 12\u201317 October 2014, New Delhi, India. ACM, New York (2014)","DOI":"10.1145\/2668322.2668329"},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"Ngo, X.T., Bhasin, S., Danger, J.L., Guilley, S., Najm, Z.: Linear complementary dual code improvement to strengthen encoded cirucit against Hardware Trojan Horses. In: Proceedings of IEEE International Symposium on Hardware Oriented Security and Trust (HOST): 2015 May 2015, Washington DC Metropolitan Area, USA. IEEE, Piscataway (2015)","DOI":"10.1109\/HST.2015.7140242"},{"key":"16_CR24","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/s11424-007-9053-y","volume":"20","author":"J Pei","year":"2007","unstructured":"Pei, J., Zhang, X.: $$1$$-generator quasi-cyclic codes. J. Syst. Sci. Complex. 20, 554\u2013561 (2007)","journal-title":"J. Syst. Sci. Complex."},{"key":"16_CR25","doi-asserted-by":"publisher","first-page":"1817","DOI":"10.1109\/18.165458","volume":"38","author":"BS Rajan","year":"1992","unstructured":"Rajan, B.S., Siddiqi, M.U.: Transform domain characterization of abelian codes. IEEE Trans. Inform. Theory 38, 1817\u20131821 (1992)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"16_CR26","doi-asserted-by":"publisher","first-page":"1745","DOI":"10.1109\/TIT.2004.831861","volume":"50","author":"G S\u00e9guin","year":"2004","unstructured":"S\u00e9guin, G.: A class of $$1$$-generator quasi-cyclic codes. IEEE Trans. Inform. Theory 50, 1745\u20131753 (2004)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"16_CR27","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.disc.2004.05.005","volume":"285","author":"N Sendrier","year":"2004","unstructured":"Sendrier, N.: Linear codes with complementary duals meet the Gilber-Varshamov bound. Discrete Math. 285, 345\u2013347 (2004)","journal-title":"Discrete Math."},{"key":"16_CR28","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/0012-365X(94)90283-6","volume":"126","author":"X Yang","year":"1994","unstructured":"Yang, X., Massey, J.L.: The condition for a cyclic code to have a complementary dual. Discrete Math. 126, 391\u2013393 (1994)","journal-title":"Discrete Math."},{"key":"16_CR29","volume-title":"Finite Fields and Galois Rings","author":"ZX Wan","year":"2012","unstructured":"Wan, Z.X.: Finite Fields and Galois Rings. World Scientific Pub. Co. Pte. Ltd., Singapore (2012)"},{"key":"16_CR30","first-page":"201","volume":"35","author":"SK Wasan","year":"1977","unstructured":"Wasan, S.K.: Quasi abelian codes. Publ. Inst. Math. 35, 201\u2013206 (1977)","journal-title":"Publ. Inst. Math."}],"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_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:05:25Z","timestamp":1710345925000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-66278-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319662770","9783319662787"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66278-7_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"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"}}]}}