{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,10]],"date-time":"2024-05-10T00:13:28Z","timestamp":1715300008172},"reference-count":13,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2022,4,1]]},"DOI":"10.1587\/transfun.2021eap1062","type":"journal-article","created":{"date-parts":[[2021,9,29]],"date-time":"2021-09-29T22:10:51Z","timestamp":1632953451000},"page":"689-693","source":"Crossref","is-referenced-by-count":0,"title":["Construction of Two Classes of Minimal Binary Linear Codes Based on Boolean Function"],"prefix":"10.1587","volume":"E105.A","author":[{"given":"Jiawei","family":"DU","sequence":"first","affiliation":[{"name":"College of Mathematics and Statistics, Northwest Normal University"},{"name":"Guangxi Key Laboratory of Cryptography and Information Security, Guilin University of Electronic Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoni","family":"DU","sequence":"additional","affiliation":[{"name":"College of Mathematics and Statistics, Northwest Normal University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wengang","family":"JIN","sequence":"additional","affiliation":[{"name":"College of Mathematics and Statistics, Northwest Normal University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingzhong","family":"ZHANG","sequence":"additional","affiliation":[{"name":"College of Mathematics and Statistics, Northwest Normal University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","unstructured":"[2] K. Khoo, \u201cSequence design and consuction of cryptographic Boolean functions,\u201d Ph.D. Thesis, University of Waterloo (Canada), 2004."},{"key":"2","doi-asserted-by":"publisher","unstructured":"[3] C. Carlet, P. Charpin, and V. Zinoviev, \u201cCodes, bent functions and permutations suitable for DES-like cryptosystems,\u201d Designs, Codes and Cryptography, vol.15, no.2, pp.125-156, 1998. 10.1023\/a:1008344232130","DOI":"10.1023\/A:1008344232130"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[4] S. Mesnager, \u201cBent functions from spreads,\u201d Journal of the American Mathematical Society, vol.632, pp.295-316, 2015.","DOI":"10.1090\/conm\/632\/12634"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[5] P.V. Kumar, R.A. Scholtz, and L.R. Welch, \u201cGeneralized bent functions and their properties,\u201d Journal of Combinatorial Theory, Series A, vol.40, no.1, pp.90-107, 1985. 10.1016\/0097-3165(85)90049-4","DOI":"10.1016\/0097-3165(85)90049-4"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[6] N. Li, T. Helleseth, X. Tang, and A. Kholosh, \u201cSeveral new classes of bent functions from Dillon exponents,\u201d IEEE Trans. Inf. Theory, vol.59, no.3, pp.1818-1831, 2013. 10.1109\/tit.2012.2229782","DOI":"10.1109\/TIT.2012.2229782"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[7] S. Mesnager, \u201cA new class of bent and hyper-bent Boolean functions in polynomial forms,\u201d Designs Codes and Cryptography, vol.59, no.1-3, pp.265-279, 2011. 10.1007\/s10623-010-9460-2","DOI":"10.1007\/s10623-010-9460-2"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[8] C. Ding and X. Wang, \u201cA coding theory consuction of new systematic authentication codes,\u201d Theor. Comput. Sci., vol.330, no.1, pp.81-99, 2005. 10.1016\/j.tcs.2004.09.011","DOI":"10.1016\/j.tcs.2004.09.011"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[9] J. Yuan and C. Ding, \u201cSecret sharing schemes from three classes of linear codes,\u201d IEEE Trans. Inf. Theory, vol.52, no.1, pp.206-212, 2006. 10.1109\/tit.2005.860412","DOI":"10.1109\/TIT.2005.860412"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[10] L.D. Baumert and R.J. Mceliece, \u201cWeights of irreducible cyclic codes,\u201d Information and Control, vol.20, no.2, pp.158-175, 1972. 10.1016\/s0019-9958(72)90354-3","DOI":"10.1016\/S0019-9958(72)90354-3"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[11] C. Ding, Z. Heng, and Z. Zhou, \u201cMinimal binary linear codes,\u201d IEEE Trans. Inf. Theory, vol.64, no.10, pp.6536-6545, 2018. 10.1109\/tit.2018.2819196","DOI":"10.1109\/TIT.2018.2819196"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[12] R. Lidl and H. Niederreiter, Finite Fields, 2nd ed., Cambridge University Press, Cambridge, 1997.","DOI":"10.1017\/CBO9780511525926"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[13] T. Helleseth and A. Kholosha, \u201cMonomial and quadratic bent functions over the finite fields of odd characteristic,\u201d IEEE Trans. Inf. Theory, vol.52, no.5, pp.2018-2032, 2006. 10.1109\/tit.2006.872854","DOI":"10.1109\/TIT.2006.872854"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[14] A. Ashikhmin and A. Barg, \u201cMinimal vectors in linear codes,\u201d IEEE Trans. Inf. Theory, vol.44, no.5, pp.2010-2017, 1998. 10.1109\/18.705584","DOI":"10.1109\/18.705584"}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E105.A\/4\/E105.A_2021EAP1062\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,9]],"date-time":"2024-05-09T05:30:12Z","timestamp":1715232612000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E105.A\/4\/E105.A_2021EAP1062\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,1]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2021eap1062","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,1]]},"article-number":"2021EAP1062"}}