Abstract
Levenshtein described in [5] a method for constructing error correcting codes which meet the Plotkin bounds, provided suitable Hadamard matrices exist. Uncertainty about the existence of Hadamard matrices on all orders multiple of 4 is a source of difficulties for the practical application of this method. Here we extend the method to the case of quasi-Hadamard matrices. Since efficient algorithms for constructing quasi-Hadamard matrices are potentially available from the literature (e.g. [7]), good error correcting codes may be constructed in practise. We illustrate the method with some examples. © Springer-Verlag Berlin Heidelberg 2007.
Author supplied keywords
Cite
CITATION STYLE
Álvarez, V., Armario, J. A., Frau, M. D., Martin, E., & Osuna, A. (2007). Error correcting codes from Quasi-Hadamard matrices. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4547 LNCS, pp. 294–302). Springer Verlag. https://doi.org/10.1007/978-3-540-73074-3_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
