English

Circulant Hadamard matrices as HFP-codes of type $C_{4n}\times C_2$

Combinatorics 2017-11-28 v1

Abstract

We prove that a circulant Hadamard code of length 4n4n can always be seen as an HFP-code (Hadamard full propelinear code) of type C4n×C2C_{4n}\times C_2, where C2=uC_2=\langle u\rangle or the same, as a cocyclic Hadamard code. We compute the rank and dimension of the kernel of these kind of codes.

Keywords

Cite

@article{arxiv.1711.09373,
  title  = {Circulant Hadamard matrices as HFP-codes of type $C_{4n}\times C_2$},
  author = {Josep Rifà},
  journal= {arXiv preprint arXiv:1711.09373},
  year   = {2017}
}