Error correcting codes from Quasi-Hadamard matrices

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4547 LNCS, Issue , 2007, Pages 294-302

  Alvarez V ^a   Armario, J A ^a   Frau, M D ^a   Martin, E ^a   Osuna, A ^a  

^a UNIVERSITY OF SEVILLE   (Spain)

Author keywords

Error correcting code; Hadamard code; Hadamard matrix

Indexed keywords

ALGORITHMS; ERROR CORRECTION; MATRIX ALGEBRA;

ERROR CORRECTING CODES; HADAMARD CODES; HADAMARD MATRICES;

CODES (SYMBOLS);

EID: 38149049276     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73074-3_23     Document Type: Conference Paper

References (10)

1. Cameron, P.J.: Combinatorics: topics, techniques, algorithms. Cambridge University Press, Cambridge (1994)
2. Feige, U., Goldwasser, S., Safra, S., Lovász, L., Szegedy, M.: Approximating clique is almost NP-complete. Proceedings 32nd Annual Symposium on the Foundations of Computer Science, FOCS, pp. 2-12 (1991)
3. 1-ε. Proceedings 37th Annual IEEE Symposium on the Foundations of Computer Science, FOCS, pp. 627-636 (1996)
4. Karp, R.M.: Reducibility among combinatorial problems. Complexity of Computer Computations, pp. 85-103 (1972)
5. Levenshtein, V.I.: Application of the Hadamard matrices to a problem in coding. Problems of Cybernetics 5, 166-184 (1964)
6. MacWilliams, F.J., Sloane, N.J.A.: The theory of error-correcting codes. North Holland, New York (1977)
7. Marchiori, E.: Genetic, Iterated and Multistart Local Search for the Maximum Clique Problem. In: Cagnoni, S., et al. (ed.) EvoIASP 2002, EvoWorkshops 2002, EvoSTIM 2002, EvoCOP 2002, and EvoPlan 2002. LNCS, vol. 2279, pp. 112-121. Springer, Heidelberg (2002)
8. Noboru, I.: Hadamard Graphs I. Graphs Combin. 1 1, 57-64 (1985)
9. Noboru, I.: Hadamard Graphs II. Graphs Combin. 1 4, 331-337 (1985)
10. Plotkin, M.: Binary codes with specified minimum distances. IEEE Trans. Information Theory 6, 445-450 (1960)