We study the maximum length of nontrivial simple-root cyclic maximum distance separable (MDS) codes over ${\mathbb F}_q$. We prove $n\le q+1$ if $\gcd(n,q^2-1)>2$, or if the dimension is even and $\gcd(n,q^2-1)>1$. The bound also holds for all lengths whose prime factors lie in $\{2,3,5,7\}$. We obtain further cases in...
Gao-Jun Luo, Xi-Wang Cao, Shi-Tao Li et al.· 0 citations
This paper investigates the quantum chromatic number of generalized Johnson graphs and determines the exact quantum chromatic numbers of two infinite families of generalized Johnson graphs, which exhibit an exponential separation between the classical and quantum chromatic numbers.
Gao-Jun Luo, Xi-Wang Cao, Shi-Tao Li et al.· 0 citations
Let <inline-formula> <tex-math notation="LaTeX">$\mathcal {C}_{(q,q^{m}+1,3,h)}$ </tex-math></inline-formula> denote the antiprimitive BCH code with designed distance 3. For any <inline-formula> <tex-math notation="LaTeX">$q$ </tex-math></inline-formula> and <inline-formula> <tex-math notation="LaTeX">$m$ </tex-math></...
Haojie Xu, Xia Wu, Wei Lu et al.· IEEE Transactions on Informa...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
