Circulant Hadamard matrices as HFP-codes of type C_(4n)times C₂
classification
🧮 math.CO
keywords
hadamardcodecirculanttimestypealwayscocycliccodes
read the original abstract
We prove that a circulant Hadamard code of length $4n$ can always be seen as an HFP-code (Hadamard full propelinear code) of type $C_{4n}\times C_2$, where $C_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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.