Ranks and Kernels of Codes From Generalized Hadamard Matrices

DOI10.1109/TIT.2015.2509061MaRDI QIDQ2976992zbMATH OpenFDO

Authors Steven T. Dougherty, Josep Rifà, M. Villanueva

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Abstract: The ranks and kernels of generalized Hadamard matrices are studied. It is proven that any generalized Hadamard matrix $H(q,lambda)$ over $F_q$, $q>3$, or $q=3$ and $gcd(3,lambda)ot=1$, generates a self-orthogonal code. This result puts a natural upper bound on the rank of the generalized Hadamard matrices. Lower and upper bounds are given for the dimension of the kernel of the corresponding generalized Hadamard codes. For specific ranks and dimensions of the kernel within these bounds, generalized Hadamard codes are constructed.

Cited in

(9)

• Generalized Hadamard full propelinear codes
• On kernels and nuclei of rank metric codes
• On the linearity and classification of \(\mathbb{Z}_{p^s} \)-linear generalized Hadamard codes
• Linearity and classification of \(\mathbb{Z}_p \mathbb{Z}_{p^2} \)-linear generalized Hadamard codes
• Partial permutation decoding and PD-sets for \(\mathbb{Z}_{p^s}\)-linear generalized Hadamard codes
• Kernels of nonlinear Hamming codes
• On the constructions of \(\mathbb{Z}_p \mathbb{Z}_{p^2}\)-linear generalized Hadamard codes
• On the equivalence of $$\mathbb {Z}_{p^s}$$-linear generalized Hadamard codes
• Some aspects of Hankel matrices in coding theory and combinatorics

This page was built for publication: Ranks and Kernels of Codes From Generalized Hadamard Matrices

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