4 papers
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 $t…
On the quantum chromatic number of Hamming and generalized Hadamard graphs
Xiwang Cao, Keqin Feng, Hexiang Huang +2
As a fundamental metric for quantifying quantum advantage in non-local games, the quantum chromatic number reveals the power of entanglement in distributed tasks. In this paper, we…
Divisibility of Griesmer Codes
Haihua Deng, Hexiang Huang, Qing Xiang
In this paper, we consider Griesmer codes, namely those linear codes meeting the Griesmer bound. Let be an Griesmer code with , where is a prime and $f\g…
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…