Keqin Feng

According to our database1, Keqin Feng authored at least 72 papers between 1999 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
On the 4-Adic Complexity of Quaternary Sequences with Ideal Autocorrelation.
CoRR, 2021

4-Adic Complexity of Interleaved Quaternary Sequences.
CoRR, 2021

Linear Complexity of Binary Interleaved Sequences of Period 4n.
CoRR, 2021

Determination of the Autocorrelation Distribution and 2-Adic Complexity of Generalized Cyclotomic Binary Sequences of Order 2 with Period pq.
CoRR, 2021

On the 4-Adic Complexity of Quaternary Sequences of Period $2p$ with Ideal Autocorrelation.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
On the 2-Adic Complexity of the Ding-Helleseth-Martinsen Binary Sequences.
IEEE Trans. Inf. Theory, 2020

A Unified Approach to Construct MDS Self-Dual Codes via Reed-Solomon Codes.
IEEE Trans. Inf. Theory, 2020

Pretty good state transfer on Cayley graphs over dihedral groups.
Discret. Math., 2020

The 4-Adic Complexity of A Class of Quaternary Cyclotomic Sequences with Period 2p.
CoRR, 2020

Determination of 2-Adic Complexity of Generalized Binary Sequences of Order 2.
CoRR, 2020

The minimum distance of new generalisations of the punctured binary Reed-Muller codes.
Cryptogr. Commun., 2020

A construction of bent functions with optimal algebraic degree and large symmetric group.
Adv. Math. Commun., 2020

On the 2-Adic Complexity of A Class of Binary Sequences of Period 4p with Optimal Autocorrelation Magnitude.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2019
On the Constructions of MDS Self-dual Codes via Cyclotomy.
CoRR, 2019

An Unified Approach on Constructing of MDS Self-dual Codes via Reed-Solomon Codes.
CoRR, 2019

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

Normal Bases on Galois Ring Extensions.
Symmetry, 2018

Relative generalized Hamming weights of cyclic codes.
Finite Fields Their Appl., 2018

Cyclotomic construction of strong external difference families in finite fields.
Des. Codes Cryptogr., 2018

Linear codes over F<sub>q</sub>[x]/(x<sup>2</sup>) and GR(p<sup>2</sup>, m) reaching the Griesmer bound.
Des. Codes Cryptogr., 2018

Minimum Distance of New Generalizations of the Punctured Binary Reed-Muller Codes.
CoRR, 2018

2017
A Construction of Linear Codes Over 𝔽<sub>2<sup>t</sup></sub> From Boolean Functions.
IEEE Trans. Inf. Theory, 2017

Complete Characterization of Generalized Bent and 2<sup>k</sup>-Bent Boolean Functions.
IEEE Trans. Inf. Theory, 2017

Multipartite Entangled States, Symmetric Matrices, and Error-Correcting Codes.
IEEE Trans. Inf. Theory, 2017

Mutually unbiased maximally entangled bases in C<sup>d</sup> ⊗ C<sup>d</sup>.
Quantum Inf. Process., 2017

Linear codes with few weights from inhomogeneous quadratic functions.
Des. Codes Cryptogr., 2017

Nonexistence of generalized bent functions from ℤ<sub>2</sub><sup>n</sup> to ℤ<sub>m</sub>.
Des. Codes Cryptogr., 2017

A class of linear codes with a few weights.
Cryptogr. Commun., 2017

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

Linear Codes over Galois Ring GR(p<sup>2</sup>, r) Related to Gauss sums.
CoRR, 2016

Construction of Cyclic and Constacyclic Codes for b-symbol Read Channels Meeting the Plotkin-like Bound.
CoRR, 2016

The $(n, m, k, λ)$-Strong External Difference Family with m≥5 Exists.
CoRR, 2016

2015
Generalized Hamming Weights of Irreducible Cyclic Codes.
IEEE Trans. Inf. Theory, 2015

Constructions on approximately mutually unbiased bases by Galois rings.
J. Syst. Sci. Complex., 2015

A new criterion on normal bases of finite field extensions.
Finite Fields Their Appl., 2015

A Construction of Linear Codes over $\f_{2^t}$ from Boolean Functions.
CoRR, 2015

Nonexistence of Generalized Bent Functions From $Z_{2}^{n}$ to $Z_{m}$.
CoRR, 2015

A lower bound on the average Hamming correlation of frequency-hopping sequence sets.
Adv. Math. Commun., 2015

2014
A new class of near-optimal partial Fourier codebooks from an almost difference set.
Des. Codes Cryptogr., 2014

2013
Planarity of mappings x(Tr(x)-α2x) on finite fields.
Finite Fields Their Appl., 2013

Unit time-phase signal sets: Bounds and constructions.
Cryptogr. Commun., 2013

2012
Two Classes of Codebooks Nearly Meeting the Welch Bound.
IEEE Trans. Inf. Theory, 2012

Construction of cyclotomic codebooks nearly meeting the Welch bound.
Des. Codes Cryptogr., 2012

Multivariate Interpolation Formula over Finite Fields and Its Applications in Coding Theory
CoRR, 2012

2011
Vectorial Boolean Functions with Good Cryptographic Properties.
Int. J. Found. Comput. Sci., 2011

Bounds on and Constructions of Unit Time-Phase Signal Sets
CoRR, 2011

2010
Asymmetric quantum codes: characterization and constructions.
IEEE Trans. Inf. Theory, 2010

2009
Constructing symmetric boolean functions with maximum algebraic immunity.
IEEE Trans. Inf. Theory, 2009

On the complexity of the normal bases via prime Gauss period over finite fields.
J. Syst. Sci. Complex., 2009

Maximal values of generalized algebraic immunity.
Des. Codes Cryptogr., 2009

An Infinite Class of Balanced Vectorial Boolean Functions with Optimum Algebraic Immunity and Good Nonlinearity.
Proceedings of the Coding and Cryptology, Second International Workshop, 2009

2008
Cyclic Codes and Sequences From Generalized Coulter-Matthews Function.
IEEE Trans. Inf. Theory, 2008

On the Weight Distributions of Two Classes of Cyclic Codes.
IEEE Trans. Inf. Theory, 2008

New balanced Boolean functions satisfying all the main cryptographic criteria.
IACR Cryptol. ePrint Arch., 2008

Weight distribution of some reducible cyclic codes.
Finite Fields Their Appl., 2008

An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity.
Proceedings of the Advances in Cryptology, 2008

2007
A Note on Symmetric Boolean Functions With Maximum Algebraic Immunity in Odd Number of Variables.
IEEE Trans. Inf. Theory, 2007

Value Distributions of Exponential Sums From Perfect Nonlinear Functions and Their Applications.
IEEE Trans. Inf. Theory, 2007

Primitive normal polynomials with the first two coefficients prescribed: A revised p-adic method.
Finite Fields Their Appl., 2007

Primitive normal polynomials with multiple coefficients prescribed: An asymptotic result.
Finite Fields Their Appl., 2007

Efficient Computation of Algebraic Immunity of Symmetric Boolean Functions.
Proceedings of the Theory and Applications of Models of Computation, 2007

Square Like Attack on Camellia.
Proceedings of the Information and Communications Security, 9th International Conference, 2007

2006
Asymptotic bounds on quantum codes from algebraic geometry codes.
IEEE Trans. Inf. Theory, 2006

The Design Principle of Hash Function with Merkle-Damgård Construction.
IACR Cryptol. ePrint Arch., 2006

Linear error-block codes.
Finite Fields Their Appl., 2006

Unextendible product bases and 1-factorization of complete graphs.
Discret. Appl. Math., 2006

On Non-binary Quantum BCH Codes.
Proceedings of the Theory and Applications of Models of Computation, 2006

2005
New Observation on Camellia.
Proceedings of the Selected Areas in Cryptography, 12th International Workshop, 2005

2004
A finite Gilbert-Varshamov bound for pure stabilizer quantum codes.
IEEE Trans. Inf. Theory, 2004

2003
New results on the nonexistence of generalized bent functions.
IEEE Trans. Inf. Theory, 2003

2002
Quantum codes [[6, 2, 3]]<sub>p</sub> and [[7, 3, 3]]<sub>p</sub> (p >= 3) exist.
IEEE Trans. Inf. Theory, 2002

1999
On Aperiodic and Periodic Complementary Binary Sequences.
IEEE Trans. Inf. Theory, 1999


  Loading...