Dongchun Han

activity

20172026

most citedErdős-Ginzburg-Ziv theorem and Noether number for

C_{m} ⋉_{φ} C_{mn}

25 citations · 26 across the 12 of their papers we have counts for

collaborators

15 papers

math.CO2026

Davenport Constants of Finite Abelian Groups

Dongchun Han, Hanbin Zhang

A central problem in zero-sum theory is to determine the Davenport constant of a finite abelian group. For a finite abelian group $G ≅ C_{n_{1}} \oplus \dots \oplus C_{n_{r}}$ , with $…

math.CO2026

How iterated sumsets grow under the assumption of small doubling

Dongchun Han, Qinghai Zhong

Let $K > 1$ be a real number and let $A ⊊ Z$ be a finite and nonempty subset. Suppose $∣ A + A ∣ < K ∣ A ∣$ . A fundamental open problem is to characterize the size of higher i…

eess.SP2026

Performance Evaluation of Mobile Target Sensing and Tracking Across Multiple Sensing Modes

Necati Kagan Erkek, Marco Di Renzo, Arman Shojaeifard +3

Moving extended-target sensing and tracking are studied in a beamformed PRS/OFDM ISAC framework. The target is modeled as a rigid cluster of scatterers whose Tx--target--Rx echoes…

math.CO2026

On zero-sum polytopes: reciprocity, rigidity, and cyclic sieving

Dongchun Han, Xuan Wang, Hanbin Zhang +1

Let $G$ be a finite abelian group of order $n$ , and let $M (G, m)$ denote the set of zero-sum sequences over $G$ of length $m$ . We introduce the zero-sum polytope $\mathcal P…

math.CO2025

A Generic Construction of $q$ -ary Near-MDS Codes Supporting 2-Designs with Lengths Beyond $q + 1$

Hengfeng Liu, Chunming Tang, Zhengchun Zhou +2

A linear code with parameters $[n, k, n - k + 1]$ is called maximum distance separable (MDS), and one with parameters $[n, k, n - k]$ is called almost MDS (AMDS). A code is near-MD…

math.CO2023★ 1 cited

New constructions of NMDS self-dual codes

Dongchun Han, Hanbin Zhang

Near maximum distance separable (NMDS) codes are important in finite geometry and coding theory. Self-dual codes are closely related to combinatorics, lattice theory, and have impo…

cs.IT2022

Near-MDS Codes from Maximal Arcs in PG $(2, q)$

Li Xu, Cuiling Fan, Dongchun Han

The singleton defect of an $[n, k, d]$ linear code $C$ is defined as $s (C) = n - k + 1 - d$ . Codes with $S (C) = 0$ are called maximum distance separable (MDS) codes, and c…

math.CO2022

A reciprocity on finite abelian groups involving zero-sum sequences II

Mao-Sheng Li, Hanbin Zhang

Let $G$ be a finite abelian group. For any positive integers $d$ and $m$ , let $φ_{G} (d)$ be the number of elements in $G$ of order $d$ and $M (G, m)$ be the set of all zero-sum…

math.RA2021

On $*$ -clean group rings over finite fields

Dongchun Han, Hanbin Zhang

A ring $R$ is called clean if every element of $R$ is the sum of a unit and an idempotent. Motivated by a question proposed by Lam on the cleanness of von Neumann Algebras, Vaš int…

math.CO2019

An improved asymptotic formula for the distribution of irreducible polynomials in arithmetic progressions over Fq

Zhang Zihan, Han Dongchun

Let $F_{q}$ be a finite field with $q$ elements and $F_{q} [x]$ the ring of polynomials over $F_{q}$ . Let $l (x), k (x)$ be coprime polynomials in $\mathbb{…

math.CO2019

A reciprocity on finite abelian groups involving zero-sum sequences

Dongchun Han, Hanbin Zhang

In this paper, we present a reciprocity on finite abelian groups involving zero-sum sequences. Let $G$ and $H$ be finite abelian groups with $(∣ G ∣, ∣ H ∣) = 1$ . For any positive integer…

math.CO2019

On an open problem about a class of optimal ternary cyclic codes

Dongchun Han, Haode Yan

Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems and communication systems as they have efficient encoding and decodi…

math.CO2018

On generalized Erdős-Ginzburg-Ziv constants of $C_{n}^{r}$

Dongchun Han, Hanbin Zhang

Let $G$ be an additive finite abelian group with exponent $exp (G) = m$ . For any positive integer $k$ , the $k$ -th generalized Erdős-Ginzburg-Ziv constant $s_{k m} (G)$ is defin…

math.CO2018

On Davenport constant of finite abelian groups

Dongchun Han

$G$ be an additive finite abelian group. The Davenport constant $D (G)$ is the smallest integer $t$ such that every sequence (multiset) $S$ over $G$ of length $∣ S ∣ \geq t$ has…

math.CO2017★ 25 cited

Erdős-Ginzburg-Ziv theorem and Noether number for $C_{m} ⋉_{φ} C_{mn}$

Dongchun Han, Hanbin Zhang

Let $G$ be a multiplicative finite group and $S = a_{1} \cdot \dots \cdot a_{k}$ a sequence over $G$ . We call $S$ a product-one sequence if $1 = \prod_{i = 1}^{k} a_{τ (i)}$ holds for some permuta…

Davenport Constants of Finite Abelian Groups

How iterated sumsets grow under the assumption of small doubling

Performance Evaluation of Mobile Target Sensing and Tracking Across Multiple Sensing Modes

On zero-sum polytopes: reciprocity, rigidity, and cyclic sieving

A Generic Construction of q-ary Near-MDS Codes Supporting 2-Designs with Lengths Beyond q+1

New constructions of NMDS self-dual codes

Near-MDS Codes from Maximal Arcs in PG(2,q)

A reciprocity on finite abelian groups involving zero-sum sequences II

On ∗-clean group rings over finite fields

An improved asymptotic formula for the distribution of irreducible polynomials in arithmetic progressions over Fq

A reciprocity on finite abelian groups involving zero-sum sequences

On an open problem about a class of optimal ternary cyclic codes

On generalized Erdős-Ginzburg-Ziv constants of Cnr​

On Davenport constant of finite abelian groups

Erdős-Ginzburg-Ziv theorem and Noether number for Cm​⋉φ​Cmn​

A Generic Construction of $q$ -ary Near-MDS Codes Supporting 2-Designs with Lengths Beyond $q + 1$

Near-MDS Codes from Maximal Arcs in PG $(2, q)$

On $*$ -clean group rings over finite fields

On generalized Erdős-Ginzburg-Ziv constants of $C_{n}^{r}$

Erdős-Ginzburg-Ziv theorem and Noether number for $C_{m} ⋉_{φ} C_{mn}$