{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T22:44:39Z","timestamp":1648853079261},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1997,7,1]],"date-time":"1997-07-01T00:00:00Z","timestamp":867715200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5860,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1997,7]]},"DOI":"10.1016\/s0304-3975(96)00278-2","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"337-345","source":"Crossref","is-referenced-by-count":2,"title":["Small weight bases for hamming codes"],"prefix":"10.1016","volume":"181","author":[{"given":"John","family":"Tromp","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Louxin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(96)00278-2_BIB1_1","series-title":"Proc. 3rd Ann. ACM Symp. on Parallel Algorithms and Architectures","first-page":"125","article-title":"Coding theory, hypercube embeddings, and fault tolerance","author":"Aiello","year":"1991"},{"key":"10.1016\/S0304-3975(96)00278-2_BIB1_2","unstructured":"IEEE Trans. Computer, to appear."},{"key":"10.1016\/S0304-3975(96)00278-2_BIB2","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/S0021-9800(67)80025-5","article-title":"On tactical configurations and error-correcting-codes","volume":"2","author":"Assmus","year":"1967","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0304-3975(96)00278-2_BIB3","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1137\/S089548019120256X","article-title":"Eulerian self-dual codes","volume":"7","author":"Babai","year":"1994","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0304-3975(96)00278-2_BIB4","series-title":"Proc. Holloway Conf. on Finite Fields","article-title":"Construction and distribution problem for irreducible trinomials over finite fields","author":"Blake","year":"1995"},{"key":"10.1016\/S0304-3975(96)00278-2_BIB5","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1002\/j.1538-7305.1950.tb00463.x","article-title":"Error detecting and error correcting codes","volume":"29","author":"Hamming","year":"1950","journal-title":"Bell System Tech. Journal"},{"key":"10.1016\/S0304-3975(96)00278-2_BIB6","first-page":"430","article-title":"Introduction to Parallel Algorithms and Architectures: Arrays \u00b7 Trees \u00b7 Hypercubes","author":"Leighton","year":"1992"},{"key":"10.1016\/S0304-3975(96)00278-2_BIB7","series-title":"Finite Fields","author":"Lidl","year":"1983"},{"key":"10.1016\/S0304-3975(96)00278-2_BIB8","series-title":"Introduction to the Theory of Error-Correcting-Codes","author":"Pless","year":"1989"},{"key":"10.1016\/S0304-3975(96)00278-2_BIB9","series-title":"DIMACS Workshops on Interconnection Networks and Mapping and Scheduling Parallel Computations","article-title":"Graph embeddings from Hamming bases","author":"Pritikin","year":"1994"},{"key":"10.1016\/S0304-3975(96)00278-2_BIB10","article-title":"Parallel input\/output architectures for multiprocessors","author":"Reddy","year":"1990"},{"key":"10.1016\/S0304-3975(96)00278-2_BIB11","doi-asserted-by":"crossref","first-page":"977","DOI":"10.1090\/S0025-5718-1973-0327722-7","article-title":"Primitive binary polynomials","volume":"124","author":"Stahnke","year":"1973","journal-title":"Math. Comput."},{"key":"10.1016\/S0304-3975(96)00278-2_BIB12","series-title":"Proc. 6th Internat. Conf. on Computing and Information","article-title":"A new bound for the width of Hamming codes","author":"Zhang","year":"1994"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002782?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002782?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T12:58:37Z","timestamp":1555419517000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397596002782"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,7]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,7]]}},"alternative-id":["S0304397596002782"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00278-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,7]]}}}