{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:37:16Z","timestamp":1775054236800,"version":"3.50.1"},"reference-count":7,"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"}],"funder":[{"DOI":"10.13039\/501100002261","name":"Russian Foundation for Basic Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002261","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,10,11]]},"DOI":"10.1109\/acct51235.2020.9383353","type":"proceedings-article","created":{"date-parts":[[2021,3,25]],"date-time":"2021-03-25T20:45:58Z","timestamp":1616705158000},"page":"1-4","source":"Crossref","is-referenced-by-count":1,"title":["On two-weight (linear and nonlinear) codes"],"prefix":"10.1109","author":[{"given":"P.","family":"Boyvalenkov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Delchev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D. V.","family":"Zinoviev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. A.","family":"Zinoviev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1112\/blms\/18.2.97"},{"key":"ref3","author":"brouwer","year":"0","journal-title":"Tables of bounds for q-ary codes"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1112\/blms\/9.3.261"},{"key":"ref5","first-page":"1626","article-title":"On linear codes of almost constant weight and the related arcs","volume":"72","author":"landjev","year":"2019","journal-title":"Compt Rend Acad Sci"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/1385-7258(81)90059-7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1134\/S0032946020010044"},{"key":"ref1","first-page":"40","article-title":"Codes with two distances: d and d+1","author":"boyvalenkov","year":"2018","journal-title":"Proc 16th Intern Workshop Algebr Combin Coding Theory"}],"event":{"name":"2020 Algebraic and Combinatorial Coding Theory (ACCT)","location":"Albena, Bulgaria","start":{"date-parts":[[2020,10,11]]},"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\/09383353.pdf?arnumber=9383353","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T15:55:30Z","timestamp":1656345330000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9383353\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,11]]},"references-count":7,"URL":"https:\/\/doi.org\/10.1109\/acct51235.2020.9383353","relation":{},"subject":[],"published":{"date-parts":[[2020,10,11]]}}}