Circulant Hadamard matrices as HFP-codes of type C_4n× C₂

2017/11/26 by Josep Rifà, Rifà, Josep
Computer Science · Engineering · Mathematics · #Coding theory and cryptography #graph theory and CDMA systems #Finite Group Theory Research

paper · pdf · doi:10.48550/arxiv.1711.09373

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× C₂, where C₂=⟨ u⟩ or the same, as a cocyclic Hadamard code. We compute the rank and dimension of the kernel of these kind of codes.

Related

• Hadamard Full Propelinear Codes of type Q. Rank and Kernel
• Hadamard full propelinear codes with associated group C_2t× C₂; rank and kernel
• Generalized Hadamard full propelinear codes
• Combinatorial properties of Circulant Hadamard matrices
• Circulant q-Butson Hadamard matrices