Searcharxiv⌕ Search

arXiv subjects

Haihua Deng

Publications and source records attributed to Haihua Deng.

7 recordsLinked to original sources

The strong cylinder conjecture and Rédei's factorization conjecture in three dimensions

In this paper, we prove the strong cylinder conjecture, that is, for every prime $p$, a set of $p^2$ points in $\mathbb F_p^3$ that meets every affine plane in a multiple of $p$ points is a union of $p$ distinct parallel affine lines. We use this result to resolve Rédei's 1970 factorization conjecture in three dimensions: if $A,B\subseteq\mathbb F_p^3$ contain zero and every vector in $\mathbb F_p^3$ has a unique expression $a+b$ with $a\in A$ and $b\in B$, then one of the two sets is contained in a plane through zero.

math.CO↗

A proof of Ward's conjecture on Griesmer codes

Let $C$ be an $[n,k,d]_q$ Griesmer code, where $q=p^f$ with $p$ prime, and write $e=ν_p(d)$. Ward conjectured that $C$ is $p^{\max\{0,e-f+1\}}$-divisible. In this paper, we prove this conjecture.

math.CO↗

Divisibility of Trace Codes

A linear code is said to be $Δ$-divisible if the Hamming weights of all its codewords are divisible by $Δ$. The $p$-adic valuation of a code is defined as the greatest integer $t$ such that the code is $p^t$-divisible. In this paper, we establish a divisibility criterion for trace codes. Specifically, this criterion provides a systematic method to determine the $p$-adic valuation of the associated trace code, thereby extending Ward's classical divisibility criterion from standard generating sets (or matrices) to generalized generator matrices over an extension field. Furthermore, we present two applications of our framework. The first application provides a concise proof of the celebrated divisibility results on semisimple Abelian codes established by Delsarte and McEliece. The second application establishes several explicit lower bounds on the $p$-adic valuation of the number of solutions over $\mathbb{F}_{q^m}$ (where $q = p^e$) to the Artin--Schreier type equation $ f(x_1,\ldots,x_k)=y^q-y $. In particular, under the coprime condition $\left(d,\frac{q^m-1}{q-1}\right)=1$, we determine the exact minimum $p$-adic valuation of the number of solutions when $f$ is restricted to homogeneous polynomials of degree $d$.

math.CO↗

The generalized Griesmer and antiGriesmer bounds

We present three proofs of the generalized Griesmer bound together with the corresponding proofs of the generalized antiGriesmer bound. The first proof follows from inequalities relating consecutive minimum and maximum subcode support weights. We also write the projective construction of Tsfasman and Vlăduţ as a residual code argument and express the geometric proof of Kurz, Landjev, and Rousseva in terms of shortened subcodes. In addition, complements in repeated simplex codes show that the two bounds are equivalent. The residual and shortening arguments also determine the consequences of equality for the resulting residual codes and shortened subcodes. Finally, the complement relation transfers known divisibility results for Griesmer codes to antiGriesmer codes.

math.CO↗

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 $Δ|{\rm wt}(c)$ for all $c\in C$, where $Δ=\left\lceil p^{e-(f-1)(q-2)}\right\rceil$.

math.CO↗

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

Let $Γ$ 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 $Γ$. We say that $C$ is a \textit{storage code} on $Γ$ if for any codeword $c \in C$, one can recover the information on each coordinate of $c$ by accessing its neighbors in $Γ$. 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émor 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↗