XXXianhong Xie
Xianhong Xie
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Xianhong Xie has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Yi Ouyang
School of Mathematical Sciences, Wu Wen-Tsun Key Laboratory of Mathematics, University of Science and Technology of China, Hefei, China
9 shared publications - Honggang Hu
University of Science and Technology of China
4 shared publications - Li Liu
School of Mathematics, Hefei University of Technology, Hefei, China
3 shared publications - Ming Mao
School of Cyberspace Security, University of Science and Technology of China, Hefei, China
2 shared publications - Sen Wang
School of Mathematical Sciences, CAS Wu Wen-Tsun Key Laboratory of Mathematics, University of Science and Technology of China, Hefei, Anhui 230026, China
2 shared publications - Tingting Wu
School of Information and Artificial Intelligence, Anhui Agricultural University, Hefei, China
2 shared publications
Latest Publications
- 1 January 2026
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 22, 185-203
Binary cyclic codes from three classes of sequences
The objective of this paper is to present the construction of binary cyclic codes from three families of sequences and develop lower bounds on the minimum distances of these codes using the BCH bound. The results show that some of these codes have length $ n $, dimension $ (n\pm1)/2 $, minimum distance $ d $ satisfying $ d^2\geq n $, and the lower bounds on the minimum distances of certain codes are tight by extensive experiments.- 1 January 2026
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 22, 185-203
Binary cyclic codes from three classes of sequences
The objective of this paper is to present the construction of binary cyclic codes from three families of sequences and develop lower bounds on the minimum distances of these codes using the BCH bound. The results show that some of these codes have length $ n $, dimension $ (n\pm1)/2 $, minimum distance $ d $ satisfying $ d^2\geq n $, and the lower bounds on the minimum distances of certain codes are tight by extensive experiments.- 1 January 2026
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 21, 267-276
Retraction: A note on subfield subcodes and trace codes of cyclic codes
Let $ \mathcal{C} $ be a cyclic code over $ \mathbb{F}_{q^m} $ of length prime to $ q $ and with the generator polynomial $ g(x)\in \mathbb{F}_{q^m}[x] $. In this paper, we determine the generator polynomials of the subfield subcode $ ( \mathcal{C})\mid_{ \mathbb{F}_q} $ and the trace code $ \mathcal{C}^{ \mathrm{Tr}} $, and prove that $ ( \mathcal{C})\mid_{ \mathbb{F}_q} = \mathcal{C}^{ \mathrm{Tr}} $ if and only if $ g(x)\in \mathbb{F}_q[x] $. Furthermore, exploiting these results, we give the characteristic polynomials of subfield subsequences and trace sequences of sequences over $ \mathbb{F}_{q^{m}} $.- 1 January 2026
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 21, 267-276
Retraction: A note on subfield subcodes and trace codes of cyclic codes
Let $ \mathcal{C} $ be a cyclic code over $ \mathbb{F}_{q^m} $ of length prime to $ q $ and with the generator polynomial $ g(x)\in \mathbb{F}_{q^m}[x] $. In this paper, we determine the generator polynomials of the subfield subcode $ ( \mathcal{C})\mid_{ \mathbb{F}_q} $ and the trace code $ \mathcal{C}^{ \mathrm{Tr}} $, and prove that $ ( \mathcal{C})\mid_{ \mathbb{F}_q} = \mathcal{C}^{ \mathrm{Tr}} $ if and only if $ g(x)\in \mathbb{F}_q[x] $. Furthermore, exploiting these results, we give the characteristic polynomials of subfield subsequences and trace sequences of sequences over $ \mathbb{F}_{q^{m}} $.- 31 January 2025
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 93 (6) , 1889-1910
On vectorial functions with maximal number of bent components
- 31 January 2025
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 93 (6) , 1889-1910
On vectorial functions with maximal number of bent components
- 18 December 2024
- Published by Elsevier in Discrete Mathematics
- Vol. 348 (4)
Binary [n,(n ± 1)/2] cyclic codes with good minimum distances from sequences
- 18 December 2024
- Published by Elsevier in Discrete Mathematics
- Vol. 348 (4)
Binary [n,(n ± 1)/2] cyclic codes with good minimum distances from sequences
- Open AccessBinary $[n,(n\pm1)/2]$ cyclic codes with good minimum distances from sequencesRecently, binary cyclic codes with parameters $[n,(n\pm1)/2,\geq \sqrt{n}]$ have been a hot topic since their minimum distances have a square-root bound. In this paper, we construct four classes of binary cyclic codes $\mathcal{C}_{\mathcal{S},0}$, $\mathcal{C}_{\mathcal{S},1}$ and $\mathcal{C}_{\mathcal{D},0}$, $\mathcal{C}_{\mathcal{D},1}$ by using two families of sequences, and obtain some codes with parameters $[n,(n\pm1)/2,\geq \sqrt{n}]$. For $m\equiv2\pmod4$, the code $\mathcal{C}_{\mathcal{S},0}$ has parameters $[2^m-1,2^{m-1},\geq2^{\frac{m}{2}}+2]$, and the code $\mathcal{C}_{\mathcal{D},0}$ has parameters $[2^m-1,2^{m-1},\geq2^{\frac{m}{2}}+2]$ if $h=1$ and $[2^m-1,2^{m-1},\geq2^{\frac{m}{2}}]$ if $h=2$.Open AccessBinary $[n,(n\pm1)/2]$ cyclic codes with good minimum distances from sequencesRecently, binary cyclic codes with parameters $[n,(n\pm1)/2,\geq \sqrt{n}]$ have been a hot topic since their minimum distances have a square-root bound. In this paper, we construct four classes of binary cyclic codes $\mathcal{C}_{\mathcal{S},0}$, $\mathcal{C}_{\mathcal{S},1}$ and $\mathcal{C}_{\mathcal{D},0}$, $\mathcal{C}_{\mathcal{D},1}$ by using two families of sequences, and obtain some codes with parameters $[n,(n\pm1)/2,\geq \sqrt{n}]$. For $m\equiv2\pmod4$, the code $\mathcal{C}_{\mathcal{S},0}$ has parameters $[2^m-1,2^{m-1},\geq2^{\frac{m}{2}}+2]$, and the code $\mathcal{C}_{\mathcal{D},0}$ has parameters $[2^m-1,2^{m-1},\geq2^{\frac{m}{2}}+2]$ if $h=1$ and $[2^m-1,2^{m-1},\geq2^{\frac{m}{2}}]$ if $h=2$.
- 1 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 69 (12) , 8111-8115
An Open Problem About Monomial Bent Functions
- 1 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 69 (12) , 8111-8115
An Open Problem About Monomial Bent Functions
- 3 October 2023
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (1)
The trace codes of several classes of linear codes
- 3 October 2023
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (1)
The trace codes of several classes of linear codes
- Open Access
Two types of narrow-sense negacyclic BCH codes
Negacyclic BCH codes are an important subclass of negacyclic codes and are the best linear codes in most cases, but their parameters are hard to determine. In this paper, we mainly study two types of negacyclic BCH codes of length $n=\frac{q^{m}-1}{4},\frac{q^{m}+1}{4}$, and give their dimensions and the lower bound on their minimum distance. Furthermore, we provide the weight distribution of narrow-sense neagcyclic BCH codes of length $n=\frac{q^m-1}{4}$ for some special designed distances.Open AccessTwo types of narrow-sense negacyclic BCH codes
Negacyclic BCH codes are an important subclass of negacyclic codes and are the best linear codes in most cases, but their parameters are hard to determine. In this paper, we mainly study two types of negacyclic BCH codes of length $n=\frac{q^{m}-1}{4},\frac{q^{m}+1}{4}$, and give their dimensions and the lower bound on their minimum distance. Furthermore, we provide the weight distribution of narrow-sense neagcyclic BCH codes of length $n=\frac{q^m-1}{4}$ for some special designed distances. - 2 August 2023
- Published by Springer Nature in Cryptography and Communications
- Vol. 15 (5) , 1011-1029
Vectorial bent functions and linear codes from quadratic forms
- 2 August 2023
- Published by Springer Nature in Cryptography and Communications
- Vol. 15 (5) , 1011-1029
Vectorial bent functions and linear codes from quadratic forms
- Open Access
On vectorial functions with maximal number of bent components
We study vectorial functions with maximal number of bent components in this paper. We first study the Walsh transform and nonlinearity of $F(x)=x^{2^e}h(\Tr_{2^{2m}/2^m}(x))$, where $e\geq0$ and $h(x)$ is a permutation over $\F_{2^m}$. If $h(x)$ is monomial, the nonlinearity of $F(x)$ is shown to be at most $ 2^{2m-1}-2^{\lfloor\frac{3m}{2}\rfloor}$ and some non-plateaued and plateaued functions attaining the upper bound are found. This gives a partial answer to the open problems proposed by Pott et al. and Anbar et al. If $h(x)$ is linear, the exact nonlinearity of $F(x)$ is determined. Secondly, we give a construction of vectorial functions with maximal number of bent components from known ones, thus obtain two new classes from the Niho class and the Maiorana-McFarland class. Our construction gives a partial answer to an open problem proposed by Pott et al., and also contains vectorial functions outside the complete Maiorana-McFarland class. Finally, we show that the vectorial function $F: \F_{2^{2m}}\rightarrow \F_{2^{2m}}$, $x\mapsto x^{2^m+1}+x^{2^i+1}$ has maximal number of bent components if and only if $i=0$.Open AccessOn vectorial functions with maximal number of bent components
We study vectorial functions with maximal number of bent components in this paper. We first study the Walsh transform and nonlinearity of $F(x)=x^{2^e}h(\Tr_{2^{2m}/2^m}(x))$, where $e\geq0$ and $h(x)$ is a permutation over $\F_{2^m}$. If $h(x)$ is monomial, the nonlinearity of $F(x)$ is shown to be at most $ 2^{2m-1}-2^{\lfloor\frac{3m}{2}\rfloor}$ and some non-plateaued and plateaued functions attaining the upper bound are found. This gives a partial answer to the open problems proposed by Pott et al. and Anbar et al. If $h(x)$ is linear, the exact nonlinearity of $F(x)$ is determined. Secondly, we give a construction of vectorial functions with maximal number of bent components from known ones, thus obtain two new classes from the Niho class and the Maiorana-McFarland class. Our construction gives a partial answer to an open problem proposed by Pott et al., and also contains vectorial functions outside the complete Maiorana-McFarland class. Finally, we show that the vectorial function $F: \F_{2^{2m}}\rightarrow \F_{2^{2m}}$, $x\mapsto x^{2^m+1}+x^{2^i+1}$ has maximal number of bent components if and only if $i=0$.