{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:10:39Z","timestamp":1778249439865,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540602163","type":"print"},{"value":"9783540447337","type":"electronic"}],"license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0030838","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T03:51:40Z","timestamp":1133409100000},"page":"235-243","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Small weight bases for hamming codes"],"prefix":"10.1007","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":"297","published-online":{"date-parts":[[2005,6,20]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"W. Aiello and T. Leighton, Coding theory, hypercube embeddings, and fault tolerance, Proc. of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 125\u2013136, 1991. To appear in IEEE Trans. Computer.","DOI":"10.1145\/113379.113391"},{"key":"25_CR2","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/S0021-9800(67)80025-5","volume":"2","author":"E. Assmus Jr","year":"1967","unstructured":"E. Assmus, Jr and H. Mattson, On tactical configurations and error-correcting-codes, J. of Combin. Theory, vol. 2, pp. 243\u2013257, 1967.","journal-title":"J. of Combin. Theory"},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1137\/S089548019120256X","volume":"7","author":"L. Babai","year":"1994","unstructured":"L. Babai, H. Oral and K. Phelps, Eulerian self-dual codes, SIAM J. Discrete Math., vol. 7, pp. 325\u2013330, 1994.","journal-title":"SIAM J. Discrete Math."},{"key":"25_CR4","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1002\/j.1538-7305.1950.tb00463.x","volume":"29","author":"R. H. Hamming","year":"1950","unstructured":"R. H. Hamming, Error detecting and error correcting codes, Bell System Technical Journal, vol. 29, pp. 147\u2013160, 1950.","journal-title":"Bell System Technical Journal"},{"key":"25_CR5","first-page":"430","volume-title":"Introduction to Parallel Algorithms and Architectures: Arrays \u00b7 Trees \u00b7 Hypercubes","author":"T. Leighton","year":"1992","unstructured":"T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays \u00b7 Trees \u00b7 Hypercubes, Morgan Kaufmann, San Mateo, California, 1992, Chapter 3, p. 430."},{"key":"25_CR6","volume-title":"Finite Fields","author":"R. Lidl","year":"1983","unstructured":"R. Lidl and H. Niederreiter, Finite Fields, Addison-Wesley, California, 1983."},{"key":"25_CR7","volume-title":"Introduction to the Theory of Error-Correcting-Codes","author":"V. Pless","year":"1989","unstructured":"V. Pless, Introduction to the Theory of Error-Correcting-Codes, John Wiley and Sons, Inc., New York, 1989."},{"key":"25_CR8","unstructured":"D. Pritikin, Graph embeddings from Hamming bases, DIMACS Workshops on Interconnection Networks and Mapping and Scheduling Parallel Computations, February 1994."},{"key":"25_CR9","volume-title":"Ph. D. dissertation","author":"A. Reddy","year":"1990","unstructured":"A. Reddy, Parallel input\/output architectures for multiprocessors, Ph. D. dissertation. Dept. of Electronical and Computer Engineering, Univ. of Illinois, Urbana, 1990."},{"key":"25_CR10","doi-asserted-by":"crossref","first-page":"977","DOI":"10.1090\/S0025-5718-1973-0327722-7","volume":"124","author":"W. Stahnke","year":"1973","unstructured":"W. Stahnke, Primitive binary polynomials, Mathematics of Computation, vol. 124, pp. 977\u2013980, 1973.","journal-title":"Mathematics of Computation"},{"key":"25_CR11","unstructured":"L. Zhang, A new bound for the width of Hamming codes, to appear in Proceedings of the 6th Inter. Conference on Computing and Information, 1994."},{"key":"25_CR12","unstructured":"I. F. Blake, S.Gao and R. J. Lambert, Construction and distribution problem for irreducible trinomials over finite fields, To appear in Proceedings of the Holloway Conference on Finite Fields, Oxford University Press, 1995."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0030838","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T13:16:02Z","timestamp":1778246162000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BFb0030838"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602163","9783540447337"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0030838","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995]]},"assertion":[{"value":"20 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}