{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:13:15Z","timestamp":1725491595825},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540730736"},{"type":"electronic","value":"9783540730743"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73074-3_23","type":"book-chapter","created":{"date-parts":[[2007,9,20]],"date-time":"2007-09-20T07:26:47Z","timestamp":1190273207000},"page":"294-302","source":"Crossref","is-referenced-by-count":1,"title":["Error Correcting Codes from Quasi-Hadamard Matrices"],"prefix":"10.1007","author":[{"given":"V.","family":"\u00c1lvarez","sequence":"first","affiliation":[]},{"given":"J. A.","family":"Armario","sequence":"additional","affiliation":[]},{"given":"M. D.","family":"Frau","sequence":"additional","affiliation":[]},{"given":"E.","family":"Martin","sequence":"additional","affiliation":[]},{"given":"A.","family":"Osuna","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511803888","volume-title":"Combinatorics: topics, techniques, algorithms","author":"P.J. Cameron","year":"1994","unstructured":"Cameron, P.J.: Combinatorics: topics, techniques, algorithms. Cambridge University Press, Cambridge (1994)"},{"key":"23_CR2","unstructured":"Feige, U., Goldwasser, S., Safra, S., Lov\u00e1sz, L., Szegedy, M.: Approximating clique is almost NP-complete. In: FOCS. Proceedings 32nd Annual Symposium on the Foundations of Computer Science, pp. 2\u201312 (1991)"},{"key":"23_CR3","first-page":"627","volume-title":"FOCS","author":"J. Hastad","year":"1996","unstructured":"Hastad, J.: Clique is hard to approximate within n\n 1\u2009\u2212\u2009\u03b5\n . In: FOCS. Proceedings 37th Annual IEEE Symposium on the Foundations of Computer Science, pp. 627\u2013636. IEEE Computer Society Press, Los Alamitos (1996)"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. Complexity of Computer Computations, pp. 85\u2013103 (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"23_CR5","first-page":"166","volume":"5","author":"V.I. Levenshtein","year":"1964","unstructured":"Levenshtein, V.I.: Application of the Hadamard matrices to a problem in coding. Problems of Cybernetics\u00a05, 166\u2013184 (1964)","journal-title":"Problems of Cybernetics"},{"key":"23_CR6","volume-title":"The theory of error-correcting codes","author":"F.J. MacWilliams","year":"1977","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The theory of error-correcting codes. North-Holland, Amsterdam (1977)"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/3-540-46004-7_12","volume-title":"Applications of Evolutionary Computing","author":"E. Marchiori","year":"2002","unstructured":"Marchiori, E.: Genetic, Iterated and Multistart Local Search for the Maximum Clique Problem. In: Cagnoni, S., Gottlieb, J., Hart, E., Middendorf, M., Raidl, G.R. (eds.) EvoIASP 2002, EvoWorkshops 2002, EvoSTIM 2002, EvoCOP 2002, and EvoPlan 2002. LNCS, vol.\u00a02279, pp. 112\u2013121. Springer, Heidelberg (2002)"},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF02582929","volume":"1","author":"I. Noboru","year":"1985","unstructured":"Noboru, I.: Hadamard Graphs I. Graphs Combin. 1\u00a01, 57\u201364 (1985)","journal-title":"Graphs Combin. 1"},{"key":"23_CR9","first-page":"331","volume":"4","author":"I. Noboru","year":"1985","unstructured":"Noboru, I.: Hadamard Graphs II. Graphs Combin. 1\u00a04, 331\u2013337 (1985)","journal-title":"Graphs Combin. 1"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1109\/TIT.1960.1057584","volume":"6","author":"M. Plotkin","year":"1960","unstructured":"Plotkin, M.: Binary codes with specified minimum distances. IEEE Trans. Information Theory\u00a06, 445\u2013450 (1960)","journal-title":"IEEE Trans. Information Theory"}],"container-title":["Lecture Notes in Computer Science","Arithmetic of Finite Fields"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73074-3_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T05:58:55Z","timestamp":1619503135000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73074-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540730736","9783540730743"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73074-3_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}