Yanfeng Qi
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
Yanfeng Qi has a total of 41 co-authors. Here are the top co-authors by number of shared publications:
- Chunming Tang
School of Information Science and Technology, Southwest Jiaotong University, Chengdu, China
23 shared publications - Sihem Mesnager
Department of Mathematics, University of Paris VIII, Saint-Denis, France
14 shared publications - Cuiling Fan
Southwest Jiaotong University
7 shared publications - Claude Carlet
University of Paris 8 Saint-Denis France
6 shared publications - Zhengchun Zhou
School of Information Science and Technology, Southwest Jiaotong University, Chengdu, Sichuan, China
6 shared publications - Chunming Tang4 shared publications
Latest Publications
- 9 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (12) , 9319-9329
Construction and Fast Decoding of Binary Linear Sum-Rank-Metric Codes
Sum-rank-metric codes have wide applications in multishot network coding and distributed storage. Linearized Reed-Solomon codes, sum-rank BCH codes and their Welch-Berlekamp decoding algorithms have been proposed and studied. In this paper, we construct binary linear sum-rank-metric codes in F2×2 2 ⊕ F2×2 2 ⊕ . . . ⊕ F2×2 2 from BCH, Goppa and additive quaternary codes. A reduction of decoding of binary sum-rank-metric codes to decoding of Hamming metric codes is given. Fast decoding algorithms of BCH-type and Goppa-type binary linear sum-rank-metric codes in F2×2 2 ⊕ F2×2 2 ⊕ . . . ⊕ F2×2 2 with the block length l, which are better than these sum-rank BCH codes, are presented. These fast decoding algorithms for BCH-type and Goppa-type binary linear sum-rank-metric codes need at most O(l2) operations in the field F4. Asymptotically good sequences of quadratic-time encodable and decodable binary linear sum-rank-metric codes with the matrix size 2×2 are constructed from Goppa codes.
- 9 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (12) , 9319-9329
Construction and Fast Decoding of Binary Linear Sum-Rank-Metric Codes
Sum-rank-metric codes have wide applications in multishot network coding and distributed storage. Linearized Reed-Solomon codes, sum-rank BCH codes and their Welch-Berlekamp decoding algorithms have been proposed and studied. In this paper, we construct binary linear sum-rank-metric codes in F2×2 2 ⊕ F2×2 2 ⊕ . . . ⊕ F2×2 2 from BCH, Goppa and additive quaternary codes. A reduction of decoding of binary sum-rank-metric codes to decoding of Hamming metric codes is given. Fast decoding algorithms of BCH-type and Goppa-type binary linear sum-rank-metric codes in F2×2 2 ⊕ F2×2 2 ⊕ . . . ⊕ F2×2 2 with the block length l, which are better than these sum-rank BCH codes, are presented. These fast decoding algorithms for BCH-type and Goppa-type binary linear sum-rank-metric codes need at most O(l2) operations in the field F4. Asymptotically good sequences of quadratic-time encodable and decodable binary linear sum-rank-metric codes with the matrix size 2×2 are constructed from Goppa codes.
- 22 July 2025
- Published by World Scientific Pub Co Pte Ltd in Journal of Algebra and Its Applications
Finalization of the proof on the bentness of Mesnager’s functions
Bent functions have been utilized in coding theory and combinatorics, and can also be applied indirectly in cryptography. An open problem on (hyper-)bent functions of particular forms was solved very recently by Tang et al. in [The solution to an open problem on the bentness of Mesnager’s functions, Finite Fields Appl. 88 (2023) 102170]. For their achievement, a graph theory method, utilizing computer experiments, was employed to prove a fundamental weight inequality. In this paper, we provide a mathematical proof of the key weight inequality established by computer experiments, thereby completing the proof supplied by Tang et al.
- 22 July 2025
- Published by World Scientific Pub Co Pte Ltd in Journal of Algebra and Its Applications
Finalization of the proof on the bentness of Mesnager’s functions
Bent functions have been utilized in coding theory and combinatorics, and can also be applied indirectly in cryptography. An open problem on (hyper-)bent functions of particular forms was solved very recently by Tang et al. in [The solution to an open problem on the bentness of Mesnager’s functions, Finite Fields Appl. 88 (2023) 102170]. For their achievement, a graph theory method, utilizing computer experiments, was employed to prove a fundamental weight inequality. In this paper, we provide a mathematical proof of the key weight inequality established by computer experiments, thereby completing the proof supplied by Tang et al.
- Open Access
Construction and Fast Decoding of Binary Linear Sum-Rank-Metric Codes
Sum-rank-metric codes have wide applications in the multishot network coding and the distributed storage. Linearized Reed-Solomon codes, sum-rank BCH codes and their Welch-Berlekamp type decoding algorithms were proposed and studied. They are sum-rank versions of Reed-Solomon codes and BCH codes in the Hamming metric. In this paper, we construct binary linear sum-rank-metric codes of the matrix size $2 \times 2$, from BCH, Goppa and additive quaternary Hamming metric codes. Larger sum-rank-metric codes than these sum-rank BCH codes of the same minimum sum-rank distances are obtained. Then a reduction of the decoding in the sum-rank-metric to the decoding in the Hamming metric is given. Fast decoding algorithms of BCH and Goppa type binary linear sum-rank-metric codes of the block length $t$ and the matrix size $2 \times 2$, which are better than these sum-rank BCH codes, are presented. These fast decoding algorithms for BCH and Goppa type binary linear sum-rank-metric codes of the matrix size $2 \times 2$ need at most $O(t^2)$ operations in the field ${\bf F}_4$. Asymptotically good sequences of quadratic-time encodable and decodable binary linear sum-rank-metric codes of the matrix size $2 \times 2$ satisfying $$R_{sr}(δ_{sr}) \geq 1-\frac{1}{2}(H_4(\frac{4}{3}δ_{sr})+H_4(2δ_{sr})),$$ can be constructed from Goppa codes.Open AccessConstruction and Fast Decoding of Binary Linear Sum-Rank-Metric Codes
Sum-rank-metric codes have wide applications in the multishot network coding and the distributed storage. Linearized Reed-Solomon codes, sum-rank BCH codes and their Welch-Berlekamp type decoding algorithms were proposed and studied. They are sum-rank versions of Reed-Solomon codes and BCH codes in the Hamming metric. In this paper, we construct binary linear sum-rank-metric codes of the matrix size $2 \times 2$, from BCH, Goppa and additive quaternary Hamming metric codes. Larger sum-rank-metric codes than these sum-rank BCH codes of the same minimum sum-rank distances are obtained. Then a reduction of the decoding in the sum-rank-metric to the decoding in the Hamming metric is given. Fast decoding algorithms of BCH and Goppa type binary linear sum-rank-metric codes of the block length $t$ and the matrix size $2 \times 2$, which are better than these sum-rank BCH codes, are presented. These fast decoding algorithms for BCH and Goppa type binary linear sum-rank-metric codes of the matrix size $2 \times 2$ need at most $O(t^2)$ operations in the field ${\bf F}_4$. Asymptotically good sequences of quadratic-time encodable and decodable binary linear sum-rank-metric codes of the matrix size $2 \times 2$ satisfying $$R_{sr}(δ_{sr}) \geq 1-\frac{1}{2}(H_4(\frac{4}{3}δ_{sr})+H_4(2δ_{sr})),$$ can be constructed from Goppa codes. - 11 January 2023
- Published by Springer Nature
- p. 183-193
The Projective General Linear Group PGL(2, $5^m$) and Linear Codes of Length $5^m+1$- 11 January 2023
- Published by Springer Nature
- p. 183-193
The Projective General Linear Group PGL(2, $5^m$) and Linear Codes of Length $5^m+1$- 1 January 2023
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 17 (6) , 1493-1506
Aperiodic/periodic complementary sequence pairs over quaternions
Aperodic (or called Golay)/Periodic complementary pairs (GCPs/ PCPs) are pairs of sequences whose aperiodic/periodic autocorrelation sums are zero everywhere, except at the zero shift. In this paper, we introduce GCPs/PCPs over the quaternion group $ Q_8 $, which is a generalization of quaternary GCPs/PCPs. Some basic properties of autocorrelations of $ Q_8 $-sequences are also obtained. We present three types of constructions for GCPs and PCPs over $ Q_8 $. The main ideas of these constructions are to consider pairs of a $ Q_8 $-sequence and its reverse, pairs of interleaving of sequence, or pairs of Kronecker product of sequences. By choosing suitable sequences in these constructions, we obtain new parameters for GCPs and PCPs, which have not been reported before.- 1 January 2023
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 17 (6) , 1493-1506
Aperiodic/periodic complementary sequence pairs over quaternions
Aperodic (or called Golay)/Periodic complementary pairs (GCPs/ PCPs) are pairs of sequences whose aperiodic/periodic autocorrelation sums are zero everywhere, except at the zero shift. In this paper, we introduce GCPs/PCPs over the quaternion group $ Q_8 $, which is a generalization of quaternary GCPs/PCPs. Some basic properties of autocorrelations of $ Q_8 $-sequences are also obtained. We present three types of constructions for GCPs and PCPs over $ Q_8 $. The main ideas of these constructions are to consider pairs of a $ Q_8 $-sequence and its reverse, pairs of interleaving of sequence, or pairs of Kronecker product of sequences. By choosing suitable sequences in these constructions, we obtain new parameters for GCPs and PCPs, which have not been reported before.- Open Access
- 4 November 2022
- Published by Springer Nature in Research Square
New Binary Sequences with Low Odd Correlation Via Interleaving Technique
Even correlation and odd correlation of sequences are two kinds of measures for their similarities. Both kinds of correlation have important applications in communication and radar. Compared with vast knowledge on sequences with good even correlation, relatively little is known on sequences with preferable odd correlation. In this paper, a generic construction of sequences with low odd correlation is proposed via interleaving technique. Notably, it can generate new sets of binary sequences with optimal odd correlation asymptotically meeting the Sarwate bound. Mathematics Subject Classification: 11B50, 11B65, 11B83.
- 4 November 2022
- Published by Springer Nature in Research Square
Open AccessNew Binary Sequences with Low Odd Correlation Via Interleaving Technique
Even correlation and odd correlation of sequences are two kinds of measures for their similarities. Both kinds of correlation have important applications in communication and radar. Compared with vast knowledge on sequences with good even correlation, relatively little is known on sequences with preferable odd correlation. In this paper, a generic construction of sequences with low odd correlation is proposed via interleaving technique. Notably, it can generate new sets of binary sequences with optimal odd correlation asymptotically meeting the Sarwate bound. Mathematics Subject Classification: 11B50, 11B65, 11B83.
- 4 May 2022
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 35 (3) , 359-375
A class of three-weight linear codes over finite fields of odd characteristic
- 4 May 2022
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 35 (3) , 359-375
A class of three-weight linear codes over finite fields of odd characteristic
- 1 September 2021
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E104.A (9) , 1361-1364
New Almost Periodic Complementary Pairs
Japan's largest platform for academic e-journals: J-STAGE is a full text database for reviewed academic papers published by Japanese societies
- 1 September 2021
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E104.A (9) , 1361-1364
New Almost Periodic Complementary Pairs
Japan's largest platform for academic e-journals: J-STAGE is a full text database for reviewed academic papers published by Japanese societies
- Open Access
- 1 January 2021
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 15 (1) , 55-64
A new class of $ p $-ary regular bent functions
Bent functions have many important applications in cryptography and coding theory. This paper considers a class of \begin{document}$ p $\end{document}-ary functions with the Dillon exponent of the form$ f(x) = \sum\limits_{i = 0}^{q-1}(Tr^n_1(a_1x^{(r i+s)(q-1)})+Tr^n_1(a_2x^{(r i+s)(q-1)+\frac{q^2-1}{2}}))+bx^{\frac{q^2-1}{2}}, $where \begin{document}$ n = 2m $\end{document}, \begin{document}$ q = p^m $\end{document}, \begin{document}$ p $\end{document} is an odd prime, \begin{document}$ a_1,a_2\in \mathbb{F}_{p^n} $\end{document}, and \begin{document}$ b\in \mathbb{F}_p $\end{document}. With the help of Kloosterman sums, we present an explicit characterization of these \begin{document}$ p $\end{document}-ary regular bent functions for the case \begin{document}$ gcd(s-r,\frac{q+1}{2}) = 1 $\end{document} and \begin{document}$ gcd(r,q+1) = 1 $\end{document} or \begin{document}$ 2 $\end{document}. Our results generalize results of Li et al. [IEEE Trans. Inf. Theory 59 (2013) 1818-1831].- 1 January 2021
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 15 (1) , 55-64
Open AccessA new class of $ p $-ary regular bent functions
Bent functions have many important applications in cryptography and coding theory. This paper considers a class of \begin{document}$ p $\end{document}-ary functions with the Dillon exponent of the form$ f(x) = \sum\limits_{i = 0}^{q-1}(Tr^n_1(a_1x^{(r i+s)(q-1)})+Tr^n_1(a_2x^{(r i+s)(q-1)+\frac{q^2-1}{2}}))+bx^{\frac{q^2-1}{2}}, $where \begin{document}$ n = 2m $\end{document}, \begin{document}$ q = p^m $\end{document}, \begin{document}$ p $\end{document} is an odd prime, \begin{document}$ a_1,a_2\in \mathbb{F}_{p^n} $\end{document}, and \begin{document}$ b\in \mathbb{F}_p $\end{document}. With the help of Kloosterman sums, we present an explicit characterization of these \begin{document}$ p $\end{document}-ary regular bent functions for the case \begin{document}$ gcd(s-r,\frac{q+1}{2}) = 1 $\end{document} and \begin{document}$ gcd(r,q+1) = 1 $\end{document} or \begin{document}$ 2 $\end{document}. Our results generalize results of Li et al. [IEEE Trans. Inf. Theory 59 (2013) 1818-1831]. - Open Access
- 1 January 2021
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 15 (1) , 9-22
A construction of $ p $-ary linear codes with two or three weights
Applied in consumer electronics, communication, data storage system, secret sharing, authentication codes, association schemes, and strongly regular graphs, linear codes attract much interest. We consider the construction of linear codes with two or three weights. Let$ m_1,\ldots, m_t $ be$ t $ positive integers and$ T = \mathbb{F}_{q_1}\times \cdots \times \mathbb{F}_{q_t} $ , where$ q_i = p^{m_i} $ for$ 1\leq i\leq t $ and$ p $ is an odd prime. A linear code $ \begin{equation*} \mathcal{C}_D = \{ \mathbf{c}(\mathbf{a}): \mathbf{a} = (a_1,\ldots,a_t)\in T\}, \end{equation*} $ can be constructed by a defining set$ D $ , where$ D $ is a subset of$ T $ and$ \mathbf{c}(\mathbf{a}) = (\sum_{i = 1}^{t}\mathrm{Tr}_1^{m_i}(a_ix_i))_{ \mathbf{x} = (x_1,\ldots,x_t)\in D} $ . We construct linear codes with two or three weights from the following three defining sets: ●$ D_0 = \{\mathbf{x}\in T\backslash \{\mathbf{0}\}: \sum_{i = 1}^t\mathrm{Tr}_1^{m_i}(x_i^2) = 0\} $ , ●$ D_{SQ} = \{\mathbf{x}\in T: \sum_{i = 1}^t\mathrm{Tr}_1^{m_i}(x_i^2)\in SQ\} $ , ●$ D_{NSQ} = \{\mathbf{x}\in T: \sum_{i = 1}^t\mathrm{Tr}_1^{m_i}(x_i^2)\in NSQ\} $ , where$ SQ $ is the set of all the squares in$ \mathbb{F}_p^* $ and$ NSQ $ is the set of all the nonsquares in$ \mathbb{F}_p^* $ . We also determine the weight distributions of these codes. The punctured codes of codes from the defining set$ D_0 $ contain optimal codes meeting certain bounds. This paper generalizes results of [22].- 1 January 2021
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 15 (1) , 9-22
Open AccessA construction of $ p $-ary linear codes with two or three weights
Applied in consumer electronics, communication, data storage system, secret sharing, authentication codes, association schemes, and strongly regular graphs, linear codes attract much interest. We consider the construction of linear codes with two or three weights. Let$ m_1,\ldots, m_t $ be$ t $ positive integers and$ T = \mathbb{F}_{q_1}\times \cdots \times \mathbb{F}_{q_t} $ , where$ q_i = p^{m_i} $ for$ 1\leq i\leq t $ and$ p $ is an odd prime. A linear code $ \begin{equation*} \mathcal{C}_D = \{ \mathbf{c}(\mathbf{a}): \mathbf{a} = (a_1,\ldots,a_t)\in T\}, \end{equation*} $ can be constructed by a defining set$ D $ , where$ D $ is a subset of$ T $ and$ \mathbf{c}(\mathbf{a}) = (\sum_{i = 1}^{t}\mathrm{Tr}_1^{m_i}(a_ix_i))_{ \mathbf{x} = (x_1,\ldots,x_t)\in D} $ . We construct linear codes with two or three weights from the following three defining sets: ●$ D_0 = \{\mathbf{x}\in T\backslash \{\mathbf{0}\}: \sum_{i = 1}^t\mathrm{Tr}_1^{m_i}(x_i^2) = 0\} $ , ●$ D_{SQ} = \{\mathbf{x}\in T: \sum_{i = 1}^t\mathrm{Tr}_1^{m_i}(x_i^2)\in SQ\} $ , ●$ D_{NSQ} = \{\mathbf{x}\in T: \sum_{i = 1}^t\mathrm{Tr}_1^{m_i}(x_i^2)\in NSQ\} $ , where$ SQ $ is the set of all the squares in$ \mathbb{F}_p^* $ and$ NSQ $ is the set of all the nonsquares in$ \mathbb{F}_p^* $ . We also determine the weight distributions of these codes. The punctured codes of codes from the defining set$ D_0 $ contain optimal codes meeting certain bounds. This paper generalizes results of [22].