Xuan Wang

collaborators

5 papers

cs.IT2026

Cyclic codes and cyclically covering subspaces

Xuan Wang, Minjia Shi

A subspace of $F_{q}^{n}$ is called cyclically covering if the union of $I ¨ ^{i} (U)$ can cover the whole space $F_{q}^{n}$ , where $I ¨ $ is the cyclic shift, $0 \leqslant i \l…

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…

cs.IT2026

New bounds for codes over Gaussian integers based on the Mannheim distance

Minjia Shi, Xuan Wang, Junmin An +1

We study linear codes over Gaussian integers equipped with the Mannheim distance. We develop Mannheim-metric analogues of several classical bounds. We derive an explicit formula fo…

math.NT2026

Second order Recurrences, quadratic number fields and cyclic codes

Minjia Shi, Xuan Wang, Bouazzaoui Zakariae +2

Wall-Sun-Sun primes (shortly WSS primes) are defined as those primes $p$ such that the period of the Fibonacci recurrence is the same modulo $p$ and modulo $p^{2} .$ This concept has…

math.CO2025

Maximum Size $t$ -Intersecting Families and Anticodes

Xuan Wang, Tuvi Etzion, Denis Krotov +1

The maximum size of $t$ -intersecting families is one of the most celebrated topics in combinatorics, and its size is known as the ErdÅs-Ko-Rado theorem. Such intersecting families…

Cyclic codes and cyclically covering subspaces

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

New bounds for codes over Gaussian integers based on the Mannheim distance

Second order Recurrences, quadratic number fields and cyclic codes

Maximum Size t-Intersecting Families and Anticodes

Maximum Size $t$ -Intersecting Families and Anticodes