{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:59:29Z","timestamp":1772283569807,"version":"3.50.1"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des Codes Crypt"],"published-print":{"date-parts":[[2006,1]]},"DOI":"10.1007\/s10623-005-5665-1","type":"journal-article","created":{"date-parts":[[2005,12,23]],"date-time":"2005-12-23T15:13:37Z","timestamp":1135350817000},"page":"125-129","source":"Crossref","is-referenced-by-count":10,"title":["A Full Rank Perfect Code of Length 31"],"prefix":"10.1007","volume":"38","author":[{"given":"Olof","family":"Heden","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"5665_CR1","first-page":"258","volume":"32","author":"S. V. Avgustinovich","year":"1996","journal-title":"Problems of Information Transmission"},{"key":"5665_CR2","unstructured":"S. V. Avgustinovich, O. Heden and F. I. Solov\u2019eva, On ranks and kernels of perfect codes, Trita-mat-2001-13 (November 2001), Preprint KTH, Stockholm, Sweden."},{"issue":"8","key":"5665_CR3","first-page":"3","volume":"1","author":"S. V. Avgustinovich","year":"2001","journal-title":"Discrete Analysis and Operation Research"},{"issue":"4","key":"5665_CR4","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1023\/B:PRIT.0000011272.10614.8c","volume":"39","author":"S. V. Avgustinovich","year":"2003","journal-title":"Problems of Information Transmission"},{"issue":"2","key":"5665_CR5","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1137\/S0895480196309171","volume":"11","author":"T. Etzion","year":"1998","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"5665_CR6","doi-asserted-by":"crossref","unstructured":"O. Heden, Perfect codes from the dual point of view I, submitted to Discrete Mathematics.","DOI":"10.1016\/j.disc.2007.11.037"},{"key":"5665_CR7","doi-asserted-by":"crossref","unstructured":"O. Heden, A remark on full rank perfect codes, submitted to Discrete Mathematics.","DOI":"10.1016\/j.disc.2006.02.014"},{"key":"5665_CR8","unstructured":"O. Heden, A property of the transpose of a perfect code, submitted to Discrete Mathematics."},{"key":"5665_CR9","doi-asserted-by":"crossref","unstructured":"P. R. J. \u00d6sterg\u00e5rd and A Vardy, Resolving the existence of full-rank tilings of binary Hamming spaces, SIAM Journal on Discrete Mathematics, to appear.","DOI":"10.1137\/S0895480104435804"},{"key":"5665_CR10","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1023\/A:1019936019517","volume":"27","author":"K. T. Phelps","year":"2002","journal-title":"Designs, Codes and Cryptography"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-005-5665-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-005-5665-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-005-5665-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:50:05Z","timestamp":1559245805000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-005-5665-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,1]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,1]]}},"alternative-id":["5665"],"URL":"https:\/\/doi.org\/10.1007\/s10623-005-5665-1","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,1]]}}}