Searcharxiv⌕ Search

arXiv subjects

Kanat Abdukhalikov

Publications and source records attributed to Kanat Abdukhalikov.

16 recordsLinked to original sources
arXiv2026

New distance bounds for one-generator quasi-cyclic codes with applications to Hermitian LCD codes and entanglement-assisted quantum codes

We introduce lower bounds on the minimum distance of one-generator quasi-cyclic codes of arbitrary index, obtained by puncturing and shortening the code at the level of its blocks. For balanced codes, these bounds form a nondecreasing chain whose first term is the Jensen bound. We apply these bounds to conduct a computer search and obtain many Hermitian LCD codes with good parameters. Among them there are six codes of length at most 30 which improve the corresponding lower bounds of Araya and Harada. These codes further give maximal-entanglement entanglement-assisted quantum codes, which we compare with the parameters currently recorded in the literature.

cs.IT↗
arXiv2026

On the equivalence between additive and linear codes

Additive codes have attracted considerable attention for their potential to outperform linear codes. However, distinguishing strictly additive codes from those that are equivalent to linear codes remains a fundamental challenge. To resolve this ambiguity, we introduce a deterministic test that requires only the generator matrix of the code. We apply this test to verify the strict additivity of several quaternary additive codes recently reported in the literature. Conversely, we demonstrate that a previously known additive complementary dual (ACD) code is equivalent to a linear Hermitian LCD code, thereby improving the best-known bounds for such linear codes.

cs.IT↗
arXiv2026

Two Families of Linear Codes Containing Non-GRS MDS Codes

We construct two new families of linear codes by modifying the generator matrices of generalized Reed-Solomon (GRS) codes. For these codes, we explicitly derive parity-check matrices and establish necessary and sufficient conditions ensuring the MDS property. Additionally, we explore subfamilies within these constructions that are non-GRS MDS codes. We also characterize their self-orthogonal and self-dual properties and present some explicit constructions and examples.

cs.IT↗
arXiv2026

Quasi-twisted codes and their connection with additive constacyclic codes over finite fields

In this paper, we study quasi-twisted codes and their relationship with additive constacyclic codes through a polynomial-based approach. We first present a polynomial characterization of quasi-twisted codes over finite fields analogous to quasi-cyclic codes and determine Euclidean, Hermitian, and symplectic duals of quasi-twisted codes with index $2$. Additionally, we provide necessary and sufficient conditions for the self-orthogonality of appropriate quasi-twisted codes. Next, we explore a one-to-one correspondence between quasi-twisted codes of length $lm$ with index $l$ over $\mathbb{F}_q$ and additive constacyclic codes of length $m$ over $\mathbb{F}_{q^l}$. We establish relationships between trace inner products in the additive setting and Euclidean, symplectic inner products in the quasi-twisted setting. Using these relations and the correspondence, we determine the dual of additive constacyclic codes with respect to the trace inner products. As a consequence, we conclude that determining the trace Euclidean dual and trace Hermitian dual of an additive constacyclic code is equivalent to determining the Euclidean and symplectic dual of the corresponding quasi-twisted code.

cs.IT↗
arXiv2026

Linear complementary dual quasi-cyclic codes of index 2

We provide a polynomial approach to investigate linear complementary dual (LCD) quasi-cyclic codes over finite fields. We establish necessary and sufficient conditions for LCD quasi-cyclic codes of index 2 with respect to the Euclidean, Hermitian, and symplectic inner products. As a consequence of these characterizations, we derive necessary and sufficient conditions for LCD one-generator quasi-cyclic codes. Furthermore, using these characterizations, we construct some new quasi-cyclic LCD codes over small fields.

cs.IT↗
arXiv2026

Linear Complementary Pairs of Quasi-Cyclic and Quasi-Twisted Codes

In this paper, we provide a polynomial characterization of linear complementary pairs of quasi-cyclic and quasi-twisted codes of index 2. We also give several examples of linear complementary pairs of quasi-cyclic and quasi-twisted codes with optimal security parameters.

cs.IT↗
arXiv2025

Some constructions of non-generalized Reed-Solomon MDS Codes

We investigate two classes of extended codes and provide necessary and sufficient conditions for these codes to be non-GRS MDS codes. We also determine the parity check matrices for these codes. Using the connection of MDS codes with arcs in finite projective spaces, we give a new characterization of o-monomials.

cs.IT↗
arXiv2025

Quasi-cyclic codes of index 2

We study quasi-cyclic codes of index 2 over finite fields. We give a classification of such codes. Their duals with respect to the Euclidean, symplectic and Hermitian inner products are investigated. We describe self-orthogonal and dual-containing codes. Lower bounds for minimum distances of quasi-cyclic codes are given. A quasi-cyclic code of index 2 is generated by at most two elements. We describe conditions when such a code (or its dual) is generated by one element.

cs.IT↗
arXiv2024

Ovoids in the cyclic presentation of PG(3,q)

We consider the cyclic presentation of $PG(3,q)$ whose points are in the finite field $\mathbb{F}_{q^4}$ and describe the known ovoids therein. We revisit the set $\mathcal{O}$, consisting of $(q^2+1)$-th roots of unity in $\mathbb{F}_{q^4}$, and prove that it forms an elliptic quadric within the cyclic presentation of $PG(3,q)$. Additionally, following the work of Glauberman on Suzuki groups, we offer a new description of Suzuki-Tits ovoids in the cyclic presentation of $PG(3,q)$, characterizing them as the zeroes of a polynomial over $\mathbb{F}_{q^4}$.

math.CO↗
arXiv2021

Polar coordinates view on KM-arcs

We study presentations of KM-arcs in polar coordinates. New characterizations on the points set of KM-arcs are obtained in terms of power sums and bilinear forms. We also construct some examples of KM-arcs in this presentation.

math.CO↗
arXiv2021

Extended cyclic codes, maximal arcs and ovoids

We show that extended cyclic codes over $\mathbb{F}_q$ with parameters $[q+2,3,q]$, $q=2^m$, determine regular hyperovals. We also show that extended cyclic codes with parameters $[qt-q+t,3,qt-q]$, $1<t<q$, determine (cyclic) Denniston maximal arcs. Similarly, cyclic codes with parameters $[q^2+1,4,q^2-q]$ are equivalent to ovoid codes obtained from elliptic quadrics in $PG(3,q)$. Finally, we give new simple presentations of Denniston maximal arcs in $PG(2,q)$ and elliptic quadrics in $PG(3,q)$.

math.CO↗
arXiv2019

Vandermonde sets and hyperovals

We consider relationships between Vandermonde sets and hyperovals. Hyperovals are Vandermonde sets, but, in general, Vandermonde sets are not hyperovals. We give necessary and sufficient conditions for a Vandermonde set to be a hyperoval. Therefore, we provide purely algebraic criteria for existence of hyperovals. Furthermore, we give necessary and sufficient conditions for the existence of hyperovals in terms of $g$-functions, which can be considered as an analog of Glynn's Theorem for o-polynomials.

math.CO↗
arXiv2017

Bent functions and line ovals

In this paper we study those bent functions which are linear on elements of spreads, their connections with ovals and line ovals, and we give descriptions of their dual bent functions. In particular, we give a geometric characterization of Niho bent functions and of their duals, we give explicit formula for the dual bent function and present direct connections with ovals and line ovals. We also show that bent functions which are linear on elements of inequivalent spreads can be EA-equivalent.

math.CO↗
arXiv2014

Symplectic spreads, planar functions and mutually unbiased bases

In this paper we give explicit descriptions of complete sets of mutually unbiased bases (MUBs) and orthogonal decompositions of special Lie algebras $sl_n(\mathbb{C})$ obtained from commutative and symplectic semifields, and from some other non-semifield symplectic spreads. Relations between various constructions are also studied. We show that the automorphism group of a complete set of MUBs is isomorphic to the automorphism group of the corresponding orthogonal decomposition of the Lie algebra $sl_n(\mathbb{C})$. In the case of symplectic spreads this automorphism group is determined by the automorphism group of the spread. By using the new notion of pseudo-planar functions over fields of characteristic two we give new explicit constructions of complete sets of MUBs.

math.CO↗
arXiv2008

Association schemes related to universally optimal configurations, Kerdock codes and extremal Euclidean line-sets

H. Cohn et. al. proposed an association scheme of 64 points in R^{14} which is conjectured to be a universally optimal code. We show that this scheme has a generalization in terms of Kerdock codes, as well as in terms of maximal real mutually unbiased bases. These schemes also related to extremal line-sets in Euclidean spaces and Barnes-Wall lattices. D. de Caen and E. R. van Dam constructed two infinite series of formally dual 3-class association schemes. We explain this formal duality by constructing two dual abelian schemes related to quaternary linear Kerdock and Preparata codes.

math.CO↗