{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T14:46:42Z","timestamp":1769525202526,"version":"3.49.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,1,19]],"date-time":"2016-01-19T00:00:00Z","timestamp":1453161600000},"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":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1007\/s10623-015-0174-3","type":"journal-article","created":{"date-parts":[[2016,1,19]],"date-time":"2016-01-19T16:28:47Z","timestamp":1453220927000},"page":"541-555","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Complementary information set codes over GF(p)"],"prefix":"10.1007","volume":"81","author":[{"given":"Hyun Jin","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoonjin","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,19]]},"reference":[{"key":"174_CR1","doi-asserted-by":"crossref","unstructured":"Camion P., Canteaut A.: Correlation-immune and resilient functions over a finite alphabet and their applications in cryptography. Des. Codes Cryptogr. 16(2), 121\u2013149 (1999)","DOI":"10.1023\/A:1008337029047"},{"key":"174_CR2","unstructured":"Cannon J., Playoust C.: An Introduction to Magma. University of Sydney, Sydney (1994)"},{"key":"174_CR3","doi-asserted-by":"crossref","unstructured":"Carlet C.: More correlation-immune and resilient functions over galois fields and galois rings. In: Advances in Cryptology\u2014EUROCRYPT\u201997. Lecture Note in Computer Sciences, vol. 1233, pp. 422-433. Springer, New York (1997)","DOI":"10.1007\/3-540-69053-0_29"},{"key":"174_CR4","doi-asserted-by":"crossref","unstructured":"Carlet C., Gaborit P., Kim J.-L., Sol\u00e9 P.: A new class of codes for Boolean masking of cryptographic computations. IEEE Trans. Inf. Theory 58, 6000\u20136011 (2012)","DOI":"10.1109\/TIT.2012.2200651"},{"key":"174_CR5","doi-asserted-by":"crossref","unstructured":"Carlet C., Freibert F., Guilley S., Kiermaier M., Kim J.-L., Sol\u00e9 P.: Higher-order CIS codes. IEEE Trans. Inf. Theory 60(9), 5283\u20135295 (2014)","DOI":"10.1109\/TIT.2014.2332468"},{"key":"174_CR6","doi-asserted-by":"crossref","unstructured":"Harada M., Munemasa A.: Classification of self-dual codes of length 36. Adv. Math. Commun. 6, 229\u2013235 (2012)","DOI":"10.3934\/amc.2012.6.229"},{"key":"174_CR7","doi-asserted-by":"crossref","unstructured":"Kim J.-L.: New extremal self-dual codes of lengths 36, 38 and 58. IEEE Trans. Inf. Theory 47, 386\u2013393 (2001)","DOI":"10.1109\/18.904540"},{"key":"174_CR8","doi-asserted-by":"crossref","unstructured":"Kim J.-L., Lee Y.: Euclidean and Hermitian self-dual MDS codes over large finite fields. J. Combin. Theory Ser. A 105(1), 79\u201395 (2004)","DOI":"10.1016\/j.jcta.2003.10.003"},{"key":"174_CR9","doi-asserted-by":"crossref","unstructured":"Kim J.-L., Lee Y.: An efficient construction of self-dual codes. Bull. Korean Math. Soc. 52(3), 915\u2013923 (2015)","DOI":"10.4134\/BKMS.2015.52.3.915"},{"key":"174_CR10","unstructured":"Lee Y.: http:\/\/math.ewha.ac.kr\/~yoonjinl\/CIS.pdf"},{"key":"174_CR11","unstructured":"MacWilliams F.J., Sloane N.J.A.: The Theory of Error Correcting Codes. Elsevier, Amsterdam (1981)"},{"key":"174_CR12","unstructured":"Pless V.S., Huffman W.C.: Handbook of Coding Theory. Elsevier, Amsterdam (1998)"},{"key":"174_CR13","doi-asserted-by":"crossref","unstructured":"Schnorr C.P., Vaudenay S.: Black box cryptanalysis of hash networks based on multipermutations. In: Advances in Cryptology\u2014EUROCRYPT\u201994. Lecture Note in Computer Science 950, pp. 47\u201357. Springer, New York (1995).","DOI":"10.1007\/BFb0053423"},{"key":"174_CR14","doi-asserted-by":"crossref","unstructured":"Siegenthaler T.: Correlation-immunity of non-linear combining functions for cryptographic applications. IEEE Trans. Inf. Theory 30(5), 776\u2013780 (1984)","DOI":"10.1109\/TIT.1984.1056949"},{"key":"174_CR15","unstructured":"Yildiz B., Ozger Z.O.: A generalization of the Lee weight to $${\\mathbb{Z}}_{p^{k}}$$ Z p k . TWMS J. Appl. Eng. Math 2(2), 145\u2013153 (2012)"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0174-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-015-0174-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0174-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:58:42Z","timestamp":1559246322000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-015-0174-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,19]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["174"],"URL":"https:\/\/doi.org\/10.1007\/s10623-015-0174-3","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1,19]]}}}