40 citations · 165 across the 27 of their papers we have counts for
6 papers · 1 filter
Divisibility of Trace Codes
Hexiang Huang, Haihua Deng, Sihuang Hu
A linear code is said to be -divisible if the Hamming weights of all its codewords are divisible by . The -adic valuation of a code is defined as the greatest integer …
3-Designs from -Invariant Subspaces of
Lewen Wang, Huawei Wu, Sihuang Hu
We present a uniform framework for constructing -designs from -invariant subspaces of , the space of homogeneous polynomials of d…
Hegedus' Conjecture and Tighter Upper Bounds for Equidistant Codes in Hamming Spaces
Sihuang Hu, Hexiang Huang, Wei-Hsuan Yu
An equidistant code is a code in the Hamming space such that two distinct codewords have the same Hamming distance. This paper investigates the bounds for equidistant codes in Hamm…
New pseudo-planar binomials in characteristic two and related schemes
Sihuang Hu, Shuxing Li, Tao Zhang +2
Planar functions in odd characteristic were introduced by Dembowski and Ostrom in order to construct finite projective planes in 1968. They were also used in the constructions of D…
Difference Sets with Few Character Values
Tao Feng, Sihuang Hu, Shuxing Li +1
The known families of difference sets can be subdivided into three classes: difference sets with Singer parameters, cyclotomic difference sets, and difference sets with gcd$(v,n)>1…
Association schemes related to Delsarte-Goethals codes
Tao Feng, Gennian Ge, Sihuang Hu
In this paper, we construct an infinite series of 9-class association schemes from a refinement of the partition of Delsarte-Goethals codes by their Lee weights. The explicit expre…