{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T00:06:32Z","timestamp":1729641992728,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1109\/isit.2011.6033928","type":"proceedings-article","created":{"date-parts":[[2011,10,6]],"date-time":"2011-10-06T13:24:20Z","timestamp":1317907460000},"page":"2105-2109","source":"Crossref","is-referenced-by-count":1,"title":["Some constructions of maximal witness codes"],"prefix":"10.1109","author":[{"given":"Nikolaos","family":"Makriyannis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bertrand","family":"Meyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1055985"},{"key":"ref11","first-page":"256","article-title":"Semidefinite programming in combinatorial and polynomial optimization","volume":"9","author":"laurent","year":"2008","journal-title":"Nieuw Arch Wiskd (5)"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2008.07.025"},{"key":"ref13","volume":"16","author":"james","year":"1981","journal-title":"Representation Theory of the Symmetric Group"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2010.4.547"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.04.007"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1003"},{"key":"ref6","article-title":"Witness sets","volume":"5228","author":"cohen","year":"2008","journal-title":"Coding Theory and Applications Second International Castle Meeting ICMCTA 2008"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0097-3165(96)80015-X"},{"key":"ref8","article-title":"Semidefinite programming, harmonic analysis and coding theory","author":"bachoc","year":"2010","journal-title":"Cimpa summer school"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.851748"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04650-0"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1007\/978-3-642-01877-0_2","article-title":"Separation and witnesses","volume":"5557","author":"cohen","year":"2009","journal-title":"Coding and Cryptology"},{"key":"ref9","article-title":"Invariant semidefinite programs","author":"bachoc","year":"0","journal-title":"Handbook of Semidefinite Cone and Polynomial Optimization Theory Algorithms Software and Applications forthcoming"}],"event":{"name":"2011 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2011,7,31]]},"location":"St. Petersburg, Russia","end":{"date-parts":[[2011,8,5]]}},"container-title":["2011 IEEE International Symposium on Information Theory Proceedings"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6026198\/6033677\/06033928.pdf?arnumber=6033928","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T03:35:45Z","timestamp":1497929745000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6033928\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isit.2011.6033928","relation":{},"subject":[],"published":{"date-parts":[[2011,7]]}}}