{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T01:46:51Z","timestamp":1729648011533,"version":"3.28.0"},"reference-count":12,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,10,11]],"date-time":"2020-10-11T00:00:00Z","timestamp":1602374400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,10,11]],"date-time":"2020-10-11T00:00:00Z","timestamp":1602374400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,10,11]],"date-time":"2020-10-11T00:00:00Z","timestamp":1602374400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,10,11]]},"DOI":"10.1109\/acct51235.2020.9383246","type":"proceedings-article","created":{"date-parts":[[2021,3,25]],"date-time":"2021-03-25T20:45:58Z","timestamp":1616705158000},"page":"113-117","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Linear Codes Over the Field of Order 7"],"prefix":"10.1109","author":[{"given":"Keita","family":"Nomura","sequence":"first","affiliation":[]},{"given":"Tatsuya","family":"Maruta","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Linear code bound [electronic table online]","year":"0","author":"grassl","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008294128110"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"505","DOI":"10.3934\/amc.2011.5.505","article-title":"On optimal ternary linear codes of dimension 6","volume":"5","author":"maruta","year":"2011","journal-title":"Adv Math Commun"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.13069\/jacodesmath.427968"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.07.045"},{"key":"ref5","first-page":"75","article-title":"Optimal linear codes","author":"hill","year":"1992","journal-title":"Cryptography and Coding II"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.07.044"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"73","DOI":"10.55630\/sjc.2013.7.73-80","article-title":"Construction of optimal linear codes by geometric puncturing","volume":"7","author":"maruta","year":"2013","journal-title":"Serdica J Computing"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(99)00088-6"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2008.12.002"},{"journal-title":"Griesmer bound for linear codes over finite fields","year":"0","author":"maruta","key":"ref9"},{"key":"ref1","article-title":"On optimal linear codes of dimension 4","author":"bono","year":"0","journal-title":"J Algebra Comb Discrete Appl"}],"event":{"name":"2020 Algebraic and Combinatorial Coding Theory (ACCT)","start":{"date-parts":[[2020,10,11]]},"location":"Albena, Bulgaria","end":{"date-parts":[[2020,10,17]]}},"container-title":["2020 Algebraic and Combinatorial Coding Theory (ACCT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9383233\/9383236\/09383246.pdf?arnumber=9383246","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,22]],"date-time":"2022-12-22T13:15:45Z","timestamp":1671714945000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9383246\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,11]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/acct51235.2020.9383246","relation":{},"subject":[],"published":{"date-parts":[[2020,10,11]]}}}