# Yanfeng Qi

According to our database1, Yanfeng Qi authored at least 48 papers between 2011 and 2020.

Collaborative distances:
• Dijkstra number2 of five.
• Erdős number3 of four.

Book
In proceedings
Article
PhD thesis
Other

## Bibliography

2020
A class of narrow-sense BCH codes over $\mathbb {F}_q$ of length $\frac{q^m-1}{2}$.
Des. Codes Cryptogr., 2020

2019
On $\sigma$ -LCD Codes.
IEEE Trans. Information Theory, 2019

New Characterization and Parametrization of LCD Codes.
IEEE Trans. Information Theory, 2019

Minimal linear codes from characteristic functions.
CoRR, 2019

Codebooks from generalized bent Z4-valued quadratic forms.
CoRR, 2019

A class of narrow-sense BCH codes over Fq of length (qm-1)/2.
CoRR, 2019

Regular p-ary bent functions with five terms and Kloosterman sums.
Cryptography and Communications, 2019

New quadratic bent functions in polynomial forms with coefficients in extension fields.
Appl. Algebra Eng. Commun. Comput., 2019

2018
Further Results on Generalized Bent Functions and Their Complete Characterization.
IEEE Trans. Information Theory, 2018

2-Correcting Lee Codes: (Quasi)-Perfect Spectral Conditions and Some Constructions.
IEEE Trans. Information Theory, 2018

Complementary Dual Algebraic Geometry Codes.
IEEE Trans. Information Theory, 2018

Linear Codes Over 𝔽q Are Equivalent to LCD Codes for q>3.
IEEE Trans. Information Theory, 2018

Euclidean and Hermitian LCD MDS codes.
Des. Codes Cryptogr., 2018

Several infinite families of p-ary weakly regular bent functions.
Adv. in Math. of Comm., 2018

Two infinite classes of rotation symmetric bent functions with simple representation.
Appl. Algebra Eng. Commun. Comput., 2018

Explicit characterization of two classes of regular bent functions.
Appl. Algebra Eng. Commun. Comput., 2018

2017
Generic Construction of Bent Functions and Bent Idempotents With Any Possible Algebraic Degrees.
IEEE Trans. Information Theory, 2017

Complete Characterization of Generalized Bent and 2k-Bent Boolean Functions.
IEEE Trans. Information Theory, 2017

Generalized Plateaued Functions and Admissible (Plateaued) Functions.
IEEE Trans. Information Theory, 2017

On σ-LCD codes.
CoRR, 2017

Linear codes over Fq which are equivalent to LCD codes.
CoRR, 2017

A class of hyper-bent functions and Kloosterman sums.
Cryptography and Communications, 2017

Ternary Linear Codes with Few Weights from Functions with Two Variables.
Proceedings of the 2017 International Conference on Cryptography, Security and Privacy, 2017

2016
Linear Codes With Two or Three Weights From Weakly Regular Bent Functions.
IEEE Trans. Information Theory, 2016

Two-Weight and Three-Weight Linear Codes From Square Functions.
IEEE Communications Letters, 2016

Binary Linear Codes With Few Weights.
IEEE Communications Letters, 2016

Complete characterization of generalized bent and 2^k-bent Boolean functions.
IACR Cryptology ePrint Archive, 2016

Special values of Kloosterman sums and binomial bent functions.
Finite Fields and Their Applications, 2016

Quasi-Perfect Lee Codes from Quadratic Curves over Finite Fields.
CoRR, 2016

2015
Constructing bent functions and bent idempotents of any possible algebraic degrees.
CoRR, 2015

Two-weight and three-weight linear codes from weakly regular bent functions.
CoRR, 2015

New infinite families of p-ary weakly regular bent functions.
CoRR, 2015

Cryptography on twisted Edwards curves over local fields.
SCIENCE CHINA Information Sciences, 2015

2014
Constructing hyper-bent functions from Boolean functions with the Walsh spectrum taking the same value twice.
IACR Cryptology ePrint Archive, 2014

Implementing optimized pairings with elliptic nets.
SCIENCE CHINA Information Sciences, 2014

A note on cyclic codes from APN functions.
Appl. Algebra Eng. Commun. Comput., 2014

2013
New Quadratic Bent Functions in Polynomial Forms with Coefficients in Extension Fields.
IACR Cryptology ePrint Archive, 2013

A new class of hyper-bent functions and Kloosterman sums.
IACR Cryptology ePrint Archive, 2013

A new class of semi-bent quadratic Boolean functions.
IACR Cryptology ePrint Archive, 2013

Effective Construction of a Class of Bent Quadratic Boolean Functions.
CoRR, 2013

An Attribute-Based Encryption Scheme with Constant-Size Ciphertexts.
Proceedings of the 2013 IEEE International Conference on Green Computing and Communications (GreenCom) and IEEE Internet of Things (iThings) and IEEE Cyber, 2013

A Note on Semi-bent and Hyper-bent Boolean Functions.
Proceedings of the Information Security and Cryptology - 9th International Conference, 2013

2012
The Weight Distributions of Cyclic Codes and Elliptic Curves.
IEEE Trans. Information Theory, 2012

A Note on Weight Distributions of Irreducible Cyclic Codes
CoRR, 2012

2011
Faster pairing computation on genus 2 hyperelliptic curves.
Inf. Process. Lett., 2011

A New Class of Hyper-bent Boolean Functions with Multiple Trace Terms.
IACR Cryptology ePrint Archive, 2011

A generalization of the class of hyper-bent Boolean functions in binomial forms.
IACR Cryptology ePrint Archive, 2011

A new class of hyper-bent Boolean functions in binomial forms
CoRR, 2011