Rank and Kernel of $\mathbb{F}_p$-Additive Generalised Hadamard Codes
Steven T. Dougherty, Josep Rif\`a, Merc\`e Villanueva

TL;DR
This paper investigates the properties of $F_p$-additive generalized Hadamard codes, establishing bounds on their rank and kernel dimension, constructing codes for specific parameters, and demonstrating their self-orthogonality and quantum code generation.
Contribution
It provides new bounds on rank and kernel dimension for $F_p$-additive GH codes and constructs codes achieving these bounds, especially for the case $e=2$, also proving their self-orthogonality and quantum code potential.
Findings
Bounds on rank and kernel dimension are established.
Explicit constructions of $F_p$-additive GH codes for certain parameters.
Codes are shown to be self-orthogonal and generate quantum codes.
Abstract
A subset of a vector space is -additive if it is a linear space over the subfield . Let , prime, and . Bounds on the rank and dimension of the kernel of generalised Hadamard (GH) codes which are -additive are established. For specific ranks and dimensions of the kernel within these bounds, -additive GH codes are constructed. Moreover, for the case , it is shown that the given bounds are tight and it is possible to construct an -additive GH code for all allowable ranks and dimensions of the kernel between these bounds. Finally, we also prove that these codes are self-orthogonal with respect to the trace Hermitian inner product, and generate pure quantum codes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Quantum Computing Algorithms and Architecture · Coding theory and cryptography
