{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T02:42:35Z","timestamp":1729651355280,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1109\/isit.2013.6620352","type":"proceedings-article","created":{"date-parts":[[2013,10,12]],"date-time":"2013-10-12T02:57:32Z","timestamp":1381546652000},"page":"879-881","source":"Crossref","is-referenced-by-count":0,"title":["Rank spectrum of propelinear perfect binary codes"],"prefix":"10.1109","author":[{"given":"George K.","family":"Guskov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivan Yu.","family":"Mogilnykh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Faina I.","family":"Solov'eva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1996.0125"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1007\/s11122-005-0025-3"},{"key":"16","first-page":"92","article-title":"On nongroup close-packed codes","volume":"8","author":"vasil'ev","year":"1965","journal-title":"Probl Kibernetiki"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.801474"},{"key":"14","first-page":"99","article-title":"On transitive codes","author":"solov'eva","year":"2004","journal-title":"Proc Int Workshop on Discrete Analysis and Operation Research"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/18.556115"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/PL00004224"},{"key":"3","doi-asserted-by":"crossref","DOI":"10.37236\/3220","article-title":"On the number of nonequivalent propelinear extended perfect codes","author":"borges","year":"2013","journal-title":"Electronic Journal of Combinatorics Submitted"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2012.6.329"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1023\/B:PRIT.0000011272.10614.8c"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-51083-4_71"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1137\/0607013"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-005-5665-1"},{"journal-title":"Properties of Perfect Transitive Binary Codes of Length 15 and Extended Perfect Transitive Binary Codes of Length 16","year":"2012","author":"guskov","key":"5"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/18.335887"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1007\/BF01388478"},{"journal-title":"The Perfect Binary One-errorcorrecting Codes of Length 15 Part i-Classification","year":"2009","author":"stergard","key":"8"}],"event":{"name":"2013 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2013,7,7]]},"location":"Istanbul, Turkey","end":{"date-parts":[[2013,7,12]]}},"container-title":["2013 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6597029\/6620166\/06620352.pdf?arnumber=6620352","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,5]],"date-time":"2020-08-05T21:47:27Z","timestamp":1596664047000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6620352\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/isit.2013.6620352","relation":{},"subject":[],"published":{"date-parts":[[2013,7]]}}}