{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T16:29:43Z","timestamp":1648916983628},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,6,16]],"date-time":"2012-06-16T00:00:00Z","timestamp":1339804800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1007\/s10623-012-9711-5","type":"journal-article","created":{"date-parts":[[2012,6,18]],"date-time":"2012-06-18T06:09:47Z","timestamp":1339999787000},"page":"1-4","source":"Crossref","is-referenced-by-count":2,"title":["Note on the size of binary Armstrong codes"],"prefix":"10.1007","volume":"71","author":[{"given":"Aart","family":"Blokhuis","sequence":"first","affiliation":[]},{"given":"Andries E.","family":"Brouwer","sequence":"additional","affiliation":[]},{"given":"Attila","family":"Sali","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,6,16]]},"reference":[{"key":"9711_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2478\/s11533-008-0001-4","volume":"6","author":"G.O.H. Katona","year":"2008","unstructured":"Katona G.O.H., Sali A., Schewe K.-D.: Codes that attain minimum distance in all possible directions. Cent. Eur. J. Math. 6, 1\u201311 (2008)","journal-title":"Cent. Eur. J. Math."},{"key":"9711_CR2","unstructured":"Keszler A.: Adatb\u00e1zisok Extrem\u00e1lis Kombinatorikai Probl\u00e9m\u00e1i, Diploma thesis Budapest University of Technology and Economics (2008)."},{"key":"9711_CR3","first-page":"499","volume-title":"Handbook of Coding Theory","author":"V.I. Levenshtein","year":"1998","unstructured":"Levenshtein V.I.: Universal bounds for codes and designs. In: Pless, V.S., Huffman, W.C. (eds) Handbook of Coding Theory, pp. 499\u2013648. Elsevier, Amsterdam (1998)"},{"key":"9711_CR4","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1109\/TIT.1977.1055688","volume":"23","author":"R.J. McEliece","year":"1977","unstructured":"McEliece R.J., Rodemich E.R., Rumsey H.C., Welch L.R.: New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities. IEEE Trans. Inf. Theory 23, 157\u2013166 (1977)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9711_CR5","unstructured":"\u00d6sterg\u00e5rd P.R.J., Pottonen O.: The perfect binary one-error-correcting codes of length 15: Part I\u2014Classification. arXiv:0806.2513, Dec (2009)."},{"key":"9711_CR6","first-page":"529","volume":"18","author":"A. Sali","year":"2008","unstructured":"Sali A., Schewe K.-D.: Keys and Armstrong databases in trees with restructuring. Acta Cybernetica 18, 529\u2013556 (2008)","journal-title":"Acta Cybernetica"},{"key":"9711_CR7","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/978-3-540-77684-0_12","volume":"4932","author":"A. Sali","year":"2008","unstructured":"Sali A., Sz\u00e9kely L.: On the existence of Armstrong instances with bounded domains. Lect. Notes Comp. Sci. 4932, 151\u2013157 (2008)","journal-title":"Lect. Notes Comp. Sci."},{"key":"9711_CR8","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1007\/978-3-642-23441-5_6","volume":"6834","author":"A. Sali","year":"2011","unstructured":"Sali A.: Coding theory motivated by relational databases. Lect. Notes Comp. Sci. 6834, 96\u2013113 (2011)","journal-title":"Lect. Notes Comp. Sci."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-012-9711-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-012-9711-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-012-9711-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:58:34Z","timestamp":1559231914000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-012-9711-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,16]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["9711"],"URL":"https:\/\/doi.org\/10.1007\/s10623-012-9711-5","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6,16]]}}}