Hadamard full propelinear codes of type Q; rank and kernel

From MaRDI portal
Publication:1650804

DOI10.1007/S10623-017-0429-2zbMATH Open1411.94102arXiv1709.02465OpenAlexW2963505783MaRDI QIDQ1650804FDOQ1650804


Authors: Josep Rifà, Emilio Suárez-Canedo Edit this on Wikidata


Publication date: 13 July 2018

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Abstract: Hadamard full propelinear codes (HFP-codes) are introduced and their equivalence with Hadamard groups is proven (on the other hand, it is already known the equivalence of Hadamard groups with relative (4n,2,4n,2n)-difference sets in a group and also with cocyclic Hadamard matrices). We compute the available values for the rank and dimension of the kernel of HFP-codes of type Q and we show that the dimension of the kernel is always 1 or 2. We also show that when the dimension of the kernel is 2 then the dimension of the kernel of the transposed code is 1 (so, both codes are not equivalent). Finally, we give a construction method such that from an HFP-code of length 4n, dimension of the kernel k=2, and maximum rank r=2n, we obtain an HFP-code of double length 8n, dimension of the kernel k=2, and maximum rank r=4n.


Full work available at URL: https://arxiv.org/abs/1709.02465




Recommendations




Cites Work


Cited In (9)





This page was built for publication: Hadamard full propelinear codes of type Q; rank and kernel

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1650804)