Chunming Tang

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2026

When Do Subset Sums in Finite Abelian Groups Support $2$ -Designs?

Hengfeng Liu, Chunming Tang, Cuiling Fan +1

Subset sums over finite abelian groups lie at the intersection of additive combinatorics, design theory, and coding theory. Let $G$ be a finite abelian group, and let $\cB_k^x$ be…

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.CO2025

Combinatorial $t$ -Designs from Finite Abelian Groups and Their Applications to Elliptic Curve Codes

Hengfeng Liu, Chunming Tang, Cuiling Fan +1

In this paper, we establish the conditions for some finite abelian groups and the family all the $k$ -sets in each of them summing up to an element $x$ to form $t$ -designs. We fully…

When Do Subset Sums in Finite Abelian Groups Support 2-Designs?

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

Combinatorial t-Designs from Finite Abelian Groups and Their Applications to Elliptic Curve Codes

When Do Subset Sums in Finite Abelian Groups Support $2$ -Designs?

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

Combinatorial $t$ -Designs from Finite Abelian Groups and Their Applications to Elliptic Curve Codes