Searcharxiv⌕ Search

arXiv subjects

Qing Xiang

Publications and source records attributed to Qing Xiang.

At least 19 recordsLinked to original sources
arXiv2026

The permutation automorphism groups of irreducible cyclic codes

The study of permutation automorphism groups of cyclic codes is a central topic in algebraic coding theory. A cyclic code over $\mathbb{F}_q$ is called irreducible if its check polynomial is irreducible over $\mathbb{F}_q$. Such a code is standard if its permutation automorphism group is equal to the group generated by the cyclic shift and the Frobenius automorphism, and non-standard otherwise. In this paper, we give a complete classification of all non-standard non-degenerate irreducible cyclic codes, using the classification of finite simple groups. Our result shows that, apart from a small number of explicit exceptional families and their descendants under certain secondary constructions, every non-degenerate irreducible cyclic code is standard, and up to four explicit exceptions, every degenerate cyclic code is non-standard. This classification has several consequences. First, it yields a general description of non-standard linear recurring sequence subgroups, extending the earlier work of Brison and Nogueira; secondly it establishes the Schmidt-White conjecture for all non-standard irreducible cyclic codes. Moreover, our results provide strong evidence in support of the conjecture of Berger and Charpin that almost all cyclic codes are standard.

math.CO↗
arXiv2025

Divisibility of Griesmer Codes

In this paper, we consider Griesmer codes, namely those linear codes meeting the Griesmer bound. Let $C$ be an $[n,k,d]_q$ Griesmer code with $q=p^f$, where $p$ is a prime and $f\ge1$ is an integer. In 1998, Ward proved that for $q=p$, if $p^e|d$, then $p^e|\mathrm{wt}(c)$ for all $c\in C$. In this paper, we show that if $q^e|d$, then $C$ has a basis consisting of $k$ codewords such that the first $\min\left\{e+1,k\right\}$ of them span a Griesmer subcode with constant weight $d$ and any $k-1$ of them span a $[g_q(k-1,d),k-1,d]_q$ Griesmer subcode. Using the $p$-adic algebraic method together with this basis, we prove that if $q^e|d$, then $p^e|\mathrm{wt}(c)$ for all $c\in C$. Based on this fact, using the geometric approach with the aforementioned basis, we show that if $p^e|d$, then $\Delta |{\rm wt}(c)$ for all $c\in C$, where $\Delta=\left\lceil p^{e-(f-1)(q-2)}\right\rceil$.

math.CO↗
arXiv2024

Non-uniform Cross-intersecting Families

Let $m\geq 2$, $n$ be positive integers, and $R_i=\{k_{i,1} >k_{i,2} >\cdots> k_{i,t_i}\}$ be subsets of $[n]$ for $i=1,2,\ldots,m$. The families $\mathcal{F}_1\subseteq \binom{[n]}{R_1},\mathcal{F}_2\subseteq \binom{[n]}{R_2},\ldots,\mathcal{F}_m\subseteq \binom{[n]}{R_m}$ are said to be non-empty cross-intersecting if for each $i\in [m]$, $\mathcal{F}_i\neq\emptyset$ and for any $A\in \mathcal{F}_i,B\in\mathcal{F}_j$, $1\leq i<j\leq m$, $|A\bigcap B|\geq1$. In this paper, we determine the maximum value of $\sum_{j=1}^{m}|\mathcal{F}_j|$ for non-empty cross-intersecting family $\mathcal{F}_1, \mathcal{F}_2,\ldots,\mathcal{F}_m$ when $n\geq k_1+k_2$, where $k_1$ (respectively, $k_2$) is the largest (respectively, second largest) value in $\{k_{1,1},k_{2,1},\ldots,k_{m,1}\}$. This result is a generalization of the results by Shi, Frankl and Qian \cite{shi2022non} on non-empty cross-intersecting families. Moreover, the extremal families are completely characterized.

math.CO↗
arXiv2024

Partial Difference Sets with Denniston Parameters in Elementary Abelian $p$-Groups

Denniston \cite{D1969} constructed partial difference sets (PDS) with parameters $(2^{3m}, (2^{m+r}-2^m+2^r)(2^m-1), 2^m-2^r+(2^{m+r}-2^m+2^r)(2^r-2), (2^{m+r}-2^m+2^r)(2^r-1))$ in elementary abelian groups of order $2^{3m}$ for all $m\geq 2$ and $1 \leq r < m$. These PDS correspond to maximal arcs in the Desarguesian projective planes PG$(2, 2^m)$. Davis et al. \cite{DHJP2024} and also De Winter \cite{dewinter23} presented constructions of PDS with Denniston parameters $(p^{3m}, (p^{m+r}-p^m+p^r)(p^m-1), p^m-p^r+(p^{m+r}-p^m+p^r)(p^r-2), (p^{m+r}-p^m+p^r)(p^r-1))$ in elementary abelian groups of order $p^{3m}$ for all $m \geq 2$ and $r \in \{1, m-1\}$, where $p$ is an odd prime. The constructions in \cite{DHJP2024, dewinter23} are particularly intriguing, as it was shown by Ball, Blokhuis, and Mazzocca \cite{BBM1997} that no nontrivial maximal arcs in PG$(2, q^m)$ exist for any odd prime power $q$. In this paper, we show that PDS with Denniston parameters $(q^{3m}, (q^{m+r}-q^m+q^r)(q^m-1), q^m-q^r+(q^{m+r}-q^m+q^r)(q^r-2), (q^{m+r}-q^m+q^r)(q^r-1))$ exist in elementary abelian groups of order $q^{3m}$ for all $m \geq 2$ and $1 \leq r < m$, where $q$ is an arbitrary prime power.

math.CO↗
arXiv2023

The BCH Family of Storage Codes on Triangle-Free Graphs is of Unit Rate

Let $\Gamma$ be a simple connected graph on $n$ vertices, and let $C$ be a code of length $n$ whose coordinates are indexed by the vertices of $\Gamma$. We say that $C$ is a \textit{storage code} on $\Gamma$ if for any codeword $c \in C$, one can recover the information on each coordinate of $c$ by accessing its neighbors in $\Gamma$. The main problem here is to construct high-rate storage codes on triangle-free graphs. In this paper, we solve an open problem posed by Barg and Z\'emor in 2022, showing that the BCH family of storage codes is of unit rate. Furthermore, we generalize the construction of the BCH family and obtain more storage codes of unit rate on triangle-free graphs.

cs.IT↗
arXiv2023

Construction of storage codes of rates approaching one on triangle-free graphs

Consider an assignment of bits to the vertices of a connected graph $Γ(V, E)$ with the property that the value of each vertex is a function of the values of its neighbors. A collection of such assignments is called a storage code of length $|V|$ on $Γ$. In this paper we construct an infinite family of binary linear storage codes on triangle-free graphs with rates arbitrarily close to one.

math.CO↗
arXiv2022

Constructions of tight sets of the Hermitian polar space $\mc{H}(2r-1,q^2)$

In this paper, we construct two infinite families of tight sets with parameters $(q^{2r-2}-1)$ and $(q^{2r-1}-q^{2r-2})$, respectively, in the Hermitian polar space $\mathcal{H}(2r-1,q^2)$ for any $r\ge 2$ and any prime power $q$. Both families admit $(q-1).\PGL(r,q^2).2.2e$ as the full automorphism group, where $q=p^e$, $p$ is a prime, and $e$ a positive integer.

math.CO↗
arXiv2021

Cyclic arcs of Singer type and strongly regular Cayley graphs over finite fields

In \cite{M18}, the first author gave a construction of strongly regular Cayley graphs on the additive group of finite fields by using three-valued Gauss periods. In particular, together with the result in \cite{BLMX}, it was shown that there exists a strongly regular Cayley graph with negative Latin square type parameters $(q^6,r(q^3+1),-q^3+r^2+3r,r^2+r)$, where $r=M(q^2-1)/2$, in the following cases: (i) $M=1$ and $q\equiv 3\,(\mod{4})$; (ii) $M=3$ and $q\equiv 7\,(\mod{24})$; and (iii) $M=7$ and $q\equiv 11,51\,(\mod{56})$. The existence of strongly regular Cayley graphs with the above parameters for odd $M>7$ was left open. In this paper, we prove that if there is an $h$, $1\le h\le M-1$, such that $M\,|\,(h^2+h+1)$ and the order of $2$ in $({\bf Z}/M{\bf Z})^\times$ is odd,then there exist infinitely many primes $q$ such that strongly regular Cayley graphs with the aforementioned parameters exist.

math.CO↗
arXiv2020

Cameron-Liebler Line Classes with parameter $x=\frac{(q+1)^2}{3}$

Cameron-Liebler line classes were introduced in \cite{CL}, and motivated by a question about orbits of collineation groups of $\PG(3,q)$. These line classes have appeared in different contexts under disguised names such as Boolean degree one functions, regular codes of covering radius one, and tight sets. In this paper we construct an infinite family of Cameron-Liebler line classes in $\PG(3,q)$ with new parameter $x=(q+1)^2/3$ for all prime powers $q$ congruent to 2 modulo 3. The examples obtained when $q$ is an odd power of two represent the first infinite family of Cameron-Liebler line classes in $\PG(3,q)$, $q$ even.

math.CO↗
arXiv2020

New Bounds for Partial Spreads of $H(2d-1, q^2)$ and Partial Ovoids of the Ree-Tits Octagon

Two results are obtained that give upper bounds on partial spreads and partial ovoids respectively. The first result is that the size of a partial spread of the Hermitian polar space $\mathsf{H}(3, q^2)$ is at most $\left(\frac{2p^3+p}{3} \right)^t+1$, where $q=p^t$, $p$ is a prime. For fixed $p$ this bound is in $o(q^3)$, which is asymptotically better than the previous best known bound of $(q^3+q+2)/2$. Similar bounds for partial spreads of $\mathsf{H}(2d-1, q^2)$, $d$ even, are given. The second result is that the size of a partial ovoid of the Ree-Tits octagon $\mathsf{O}(2^t)$ is at most $26^t+1$. This bound, in particular, shows that the Ree-Tits octagon $\mathsf{O}(2^t)$ does not have an ovoid.

math.CO↗
arXiv2020

Linear representations of finite geometries and associated LDPC codes

The {\it linear representation} of a subset of a finite projective space is an incidence system of affine points and lines determined by the subset. In this paper we use character theory to show that the rank of the incidence matrix has a direct geometric interpretation in terms of certain hyperplanes. We consider the LDPC codes defined by taking the incidence matrix and its transpose as parity-check matrices, and in the former case prove a conjecture of Vandendriessche that the code is generated by words of minimum weight called plane words. In the latter case we compute the minimum weight in several cases and provide explicit constructions of minimum weight codewords.

math.CO↗
arXiv2019

On $m$-ovoids of Symplectic Polar Spaces

In this paper, we develop a new method for constructing $m$-ovoids in the symplectic polar space $\W(2r-1,\q)$ from some strongly regular Cayley graphs in \cite{Brouwer1999Journal}. Using this method, we obtain many new $m$-ovoids which can not be derived by field reduction.

math.CO↗
arXiv2019

A new family of Hadamard matrices of order $4(2q^2+1)$

Let $q$ be a prime power of the form $q=12c^2+4c+3$ with $c$ an arbitrary integer. In this paper we construct a difference family with parameters $(2q^2;q^2,q^2,q^2,q^2-1;2q^2-2)$ in ${\mathbb Z}_2\times ({\mathbb F}_{q^2},+)$. As a consequence, by applying the Wallis-Whiteman array, we obtain Hadamard matrices of order $4(2q^2+1)$ for the aforementioned $q$'s.

math.CO↗
arXiv2019

Generalized constructions of Menon-Hadamard difference sets

We revisit the problem of constructing Menon-Hadamard difference sets. In 1997, Wilson and Xiang gave a general framework for constructing Menon-Hadamard difference sets by using a combination of a spread and four projective sets of type Q in ${\mathrm{PG}}(3,q)$. They also found examples of suitable spreads and projective sets of type Q for $q=5,13,17$. Subsequently, Chen (1997) succeeded in finding a spread and four projective sets of type Q in ${\mathrm{PG}}(3,q)$ satisfying the conditions in the Wilson-Xiang construction for all odd prime powers $q$. Thus, he showed that there exists a Menon-Hadamard difference set of order $4q^4$ for all odd prime powers $q$. However, the projective sets of type Q found by Chen have automorphisms different from those of the examples constructed by Wilson and Xiang. In this paper, we first generalize Chen's construction of projective sets of type Q by using `semi-primitive' cyclotomic classes. This demonstrates that the construction of projective sets of type Q satisfying the conditions in the Wilson-Xiang construction is much more flexible than originally thought. Secondly, we give a new construction of spreads and projective sets of type Q in ${\mathrm{PG}}(3,q)$ for all odd prime powers $q$, which generalizes the examples found by Wilson and Xiang. This solves a problem left open in Section 5 of the Wilson-Xiang paper from 1997.

math.CO↗
arXiv2018

Cyclotomy, difference sets, sequences with low correlation, strongly regular graphs, and related geometric substructures

In this paper, we survey constructions of and nonexistence results on combinatorial/geometric structures which arise from unions of cyclotomic classes of finite fields. In particular, we survey both classical and recent results on difference sets related to cyclotomy, and cyclotomic constructions of sequences with low correlation. We also give an extensive survey of recent results on constructions of strongly regular Cayley graphs and related geometric substructures such as $m$-ovoids and $i$-tight sets in classical polar spaces.

math.CO↗
arXiv2018

The shift bound for abelian codes and generalizations of the Donoho-Stark uncertainty principle

Let $G$ be a finite abelian group. If $f: G\rightarrow \bC$ is a nonzero function with Fourier transform $\hf$, the Donoho-Stark uncertainty principle states that $|\supp(f)||\supp(\hf)|\geq |G|$. The purpose of this paper is twofold. First, we present the shift bound for abelian codes with a streamlined proof. Second, we use the shifting technique to prove a generalization and a sharpening of the Donoho-Stark uncertainty principle. In particular, the sharpened uncertainty principle states, with notation above, that $|\supp(f)||\supp(\hf)|\geq |G|+|\supp(f)|-|H(\supp(f))|$, where $H(\supp(f))$ is the stabilizer of $\supp(f)$ in $G$.

math.CO↗