Abstract
The rank, r, and the dimension of the kernel, k, for binary Hadamard codes of length 2 t were studied in [12], constructing such codes for all possible pairs (r, k). Now, we will focus on Hadamard codes of length 2 t · s, s > 1 odd. As long as there exists a Hadamard code of length 4s, constructions of Hadamard codes of length n = 2 t · s (t ≥ 3) with any rank, r ∈{4s + t -3, . . ., n/2}, and any possible dimension of the kernel, k ∈ {1, . . ., t-1}, are given. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Phelps, K. T., Rifà, J., & Villanueva, M. (2006). Hadamard codes of length 2 ts (s Odd). Rank and kernel. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3857 LNCS, pp. 328–337). https://doi.org/10.1007/11617983_32
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
