{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T04:37:36Z","timestamp":1648874256111},"reference-count":9,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2022,3,1]]},"DOI":"10.1587\/transfun.2021tap0007","type":"journal-article","created":{"date-parts":[[2021,9,13]],"date-time":"2021-09-13T22:08:34Z","timestamp":1631570914000},"page":"372-380","source":"Crossref","is-referenced-by-count":0,"title":["A Construction of Binary Punctured Linear Codes and A Supporting Method for Best Code Search"],"prefix":"10.1587","volume":"E105.A","author":[{"given":"Takuya","family":"OHARA","sequence":"first","affiliation":[{"name":"Graduate School of Engineering, Kobe University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Makoto","family":"TAKITA","sequence":"additional","affiliation":[{"name":"School of Social Information Science, University of Hyogo"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masakatu","family":"MORII","sequence":"additional","affiliation":[{"name":"Graduate School of Engineering, Kobe University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] M. Grassl, \u201cCode tables: Bounds on the parameters of various types of codes,\u201d http:\/\/codetables.de, accessed June 2021."},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] C. Ding, C. Fan, and Z. Zhou, \u201cThe dimension and minimum distance of two classes of primitive BCH codes,\u201d Finite Fields Th. App., vol.45, pp.237-263, May 2016. 10.1016\/j.ffa.2016.12.009","DOI":"10.1016\/j.ffa.2016.12.009"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] Y. Kageyama and T. Maruta, \u201cOn the geometric constructions of optimal linear codes,\u201d Des. Codes Cryptogr., vol.81, no.3, pp.469-480, 2016. 10.1007\/s10623-015-0167-2","DOI":"10.1007\/s10623-015-0167-2"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] N. Aydin and D. Foret, \u201cNew linear codes over <i>GF<\/i>(3), <i>GF<\/i>(11), and <i>GF<\/i>(13),\u201d Journal of Algebra Combinatorics Discrete Structures and Applications, vol.6, no.1, pp.13-20, 2019. 10.13069\/jacodesmath.508968","DOI":"10.13069\/jacodesmath.508968"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] A.M. Berg and I.I. Dumer, \u201cOn computing the weight spectrum of cyclic codes,\u201d IEEE Trans. Inf. Theory, vol.38, no.4, pp.1382-1386, 1992. 10.1109\/18.144721","DOI":"10.1109\/18.144721"},{"key":"6","unstructured":"[6] Z. Li, M. Mohri, and M. Morii, \u201cAn efficient method for computing the minimum weight of high rate binary cyclic codes,\u201d ISITA2006, pp.741-746, Nov. 2006."},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] J. Zwanzger,\u201cA heuristic algorithm for the construction of good linear codes,\u201d IEEE Trans. Inf. Theory, vol.54, no.5, pp.2388-2392, 2008. 10.1109\/tit.2008.920323","DOI":"10.1109\/TIT.2008.920323"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] H.A. Priestley and M.P. Ward, \u201cA multipurpose backtracking algorithm,\u201d J. Symb. Comput., vol.18, no.1, pp.1-40, July 1994. 10.1006\/jsco.1994.1035","DOI":"10.1006\/jsco.1994.1035"},{"key":"9","unstructured":"[9] T. Ohara, M. Takita, and M. Morii, \u201cA construction of binary punctured linear codes and a supporting method for best code search,\u201d ISITA2020, pp.170-174, Oct. 2020."}],"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\/3\/E105.A_2021TAP0007\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,5]],"date-time":"2022-03-05T03:20:44Z","timestamp":1646450444000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E105.A\/3\/E105.A_2021TAP0007\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,1]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2021tap0007","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,1]]},"article-number":"2021TAP0007"}}