{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T23:09:38Z","timestamp":1774566578402,"version":"3.50.1"},"reference-count":11,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T00:00:00Z","timestamp":1634428800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T00:00:00Z","timestamp":1634428800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T00:00:00Z","timestamp":1634428800000},"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":[[2021,10,17]]},"DOI":"10.1109\/itw48936.2021.9611478","type":"proceedings-article","created":{"date-parts":[[2021,11,23]],"date-time":"2021-11-23T21:46:27Z","timestamp":1637703987000},"page":"1-5","source":"Crossref","is-referenced-by-count":9,"title":["Linear Programming Bounds on the Kissing Number of q-ary Codes"],"prefix":"10.1109","author":[{"given":"Patrick","family":"Sole","sequence":"first","affiliation":[]},{"given":"Yi","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Cheng","sequence":"additional","affiliation":[]},{"given":"Sylvain","family":"Guilley","sequence":"additional","affiliation":[]},{"given":"Olivier","family":"Riou","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","year":"2021","journal-title":"MAGMA computational algebra system"},{"key":"ref3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58575-3","author":"van lint","year":"1999","journal-title":"Introduction to Coding Theory"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s12095-017-0271-4"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2020.3009609"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.2001.3206"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2001.935974"},{"key":"ref8","author":"grassl","year":"2007","journal-title":"Bounds On The Minimum Distance Of Linear Codes And Quantum Codes"},{"key":"ref7","article-title":"Bounds on unrestricted codes, by linear programming","volume":"27","author":"delsarte","year":"1972","journal-title":"Philips Res Repts"},{"key":"ref2","author":"mac williams","year":"1981","journal-title":"The Theory of Error Correcting Codes"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011203416769"},{"key":"ref1","author":"proakis","year":"2008","journal-title":"Digital Communications"}],"event":{"name":"2021 IEEE Information Theory Workshop (ITW)","location":"Kanazawa, Japan","start":{"date-parts":[[2021,10,17]]},"end":{"date-parts":[[2021,10,21]]}},"container-title":["2021 IEEE Information Theory Workshop (ITW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9611366\/9611357\/09611478.pdf?arnumber=9611478","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T16:52:06Z","timestamp":1652201526000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9611478\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,17]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/itw48936.2021.9611478","relation":{},"subject":[],"published":{"date-parts":[[2021,10,17]]}}}