Chunming Tang

Orcid: 0000-0001-9599-851X

Affiliations:
  • China West Normal University, Nanchong, China


According to our database1, Chunming Tang authored at least 113 papers between 2011 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Large Sets of Binary Spreading Sequences With Low Correlation and Low PAPR via Gold Functions.
IEEE Trans. Inf. Theory, July, 2024

Codes and pseudo-geometric designs from the ternary <i>m</i>-sequences with Welch-type decimation <i>d</i> = 2 ⋅ 3<sup>(<i>n</i>-1)/2</sup> + 1.
Finite Fields Their Appl., February, 2024

2023
The solution to an open problem on the bentness of Mesnager's functions.
Finite Fields Their Appl., June, 2023

Infinite Families of Cyclic and Negacyclic Codes Supporting 3-Designs.
IEEE Trans. Inf. Theory, April, 2023

Some 3-designs and shortened codes from binary cyclic codes with three zeros.
Finite Fields Their Appl., 2023

The minimum locality of linear codes.
Des. Codes Cryptogr., 2023

Codes and Pseudo-Geometric Designs from the Ternary m-Sequences with Welch-type decimation d=2·3<sup>(n-1)/2</sup>+1.
CoRR, 2023

2022
Shortened Linear Codes From APN and PN Functions.
IEEE Trans. Inf. Theory, 2022

The Subfield Codes and Subfield Subcodes of a Family of MDS Codes.
IEEE Trans. Inf. Theory, 2022

Binary [n, (n + 1)/2] Cyclic Codes With Good Minimum Distances.
IEEE Trans. Inf. Theory, 2022

On Infinite Families of Narrow-Sense Antiprimitive BCH Codes Admitting 3-Transitive Automorphism Groups and Their Consequences.
IEEE Trans. Inf. Theory, 2022

A class of twisted generalized Reed-Solomon codes.
Des. Codes Cryptogr., 2022

An infinite family of antiprimitive cyclic codes supporting Steiner systems S(3, 8, 7<sup>m+1)</sup>.
Des. Codes Cryptogr., 2022

Some shortened codes from linear codes constructed by defining sets.
Adv. Math. Commun., 2022

Preface.
Adv. Math. Commun., 2022

Infinite families of 2-designs from two classes of binary cyclic codes with three nonzeros.
Adv. Math. Commun., 2022

Möbius transformations and characterizations of hyper-bent functions from Dillon-like exponents with coefficients in extension fields.
Adv. Math. Commun., 2022

Infinite families of 2-designs from linear codes.
Appl. Algebra Eng. Commun. Comput., 2022

The Projective General Linear Group PGL(2, 5<sup>m</sup>) and Linear Codes of Length 5<sup>m+1</sup>.
Proceedings of the Arithmetic of Finite Fields - 9th International Workshop, 2022

2021
Full Characterization of Minimal Linear Codes as Cutting Blocking Sets.
IEEE Trans. Inf. Theory, 2021

An Infinite Family of Linear Codes Supporting 4-Designs.
IEEE Trans. Inf. Theory, 2021

Fast Algebraic Immunity of Boolean Functions and LCD Codes.
IEEE Trans. Inf. Theory, 2021

Shortened Linear Codes Over Finite Fields.
IEEE Trans. Inf. Theory, 2021

A Novel Application of Boolean Functions With High Algebraic Immunity in Minimal Codes.
IEEE Trans. Inf. Theory, 2021

Cyclic Bent Functions and Their Applications in Sequences.
IEEE Trans. Inf. Theory, 2021

An Open Problem on the Bentness of Mesnager’s Functions.
IACR Cryptol. ePrint Arch., 2021

The projective general linear group ${\mathrm {PGL}}(2, 2^m)$ and linear codes of length 2<sup>m+1</sup>.
Des. Codes Cryptogr., 2021

An infinite family of antiprimitive cyclic codes supporting Steiner systems S(3, 8, 7<sup>m</sup>+1).
CoRR, 2021

An Open Problem on the Bentness of Mesnager's Functions.
CoRR, 2021

The linear codes of t-designs held in the Reed-Muller and Simplex codes.
Cryptogr. Commun., 2021

A new class of p-ary regular bent functions.
Adv. Math. Commun., 2021

A construction of p-ary linear codes with two or three weights.
Adv. Math. Commun., 2021

Infinite families of 3-designs from o-polynomials.
Adv. Math. Commun., 2021

2020
Codes, Differentially $\delta$ -Uniform Functions, and $t$ -Designs.
IEEE Trans. Inf. Theory, 2020

Minimal Linear Codes From Characteristic Functions.
IEEE Trans. Inf. Theory, 2020

Infinite Families of Near MDS Codes Holding t-Designs.
IEEE Trans. Inf. Theory, 2020

Codebooks from generalized bent Z4-valued quadratic forms.
Discret. Math., 2020

New characterizations and construction methods of bent and hyper-bent Boolean functions.
Discret. Math., 2020

On the boomerang uniformity of quadratic permutations.
Des. Codes Cryptogr., 2020

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

Linear codes of 2-designs associated with subcodes of the ternary generalized Reed-Muller codes.
Des. Codes Cryptogr., 2020

The Projective General Linear Group PGL<sub>2</sub>(GF(2s<sup>m</sup>)) and Linear Codes of Length 2<sup>m</sup>+1.
CoRR, 2020

On the Menezes-Teske-Weng conjecture.
Cryptogr. Commun., 2020

Combinatorial t-designs from special functions.
Cryptogr. Commun., 2020

2019
Binary LCD Codes and Self-Orthogonal Codes From a Generic Construction.
IEEE Trans. Inf. Theory, 2019

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

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

On the boomerang uniformity of quadratic permutations over 픽<sub>2<sup>n</sup></sub>.
IACR Cryptol. ePrint Arch., 2019

Steiner systems $$S(2, 4, \frac{3^m-1}{2})$$ and 2-designs from ternary linear codes of length $$\frac{3^m-1}{2}$$.
Des. Codes Cryptogr., 2019

Further study on the maximum number of bent components of vectorial functions.
Des. Codes Cryptogr., 2019

Codes, differentially δ-uniform functions and t-designs.
CoRR, 2019

Codebooks from generalized bent Z<sub>4</sub>-valued quadratic forms.
CoRR, 2019

A class of narrow-sense BCH codes over F<sub>q</sub> of length (q<sup>m</sup>-1)/2.
CoRR, 2019

On the boomerang uniformity of (quadratic) permutations over F<sub>2<sup>n</sup></sub>.
CoRR, 2019

Steiner systems S(2, 4, 3<sup>m</sup>-1/2) and 2-designs from ternary linear codes of length 3<sup>m</sup>-1/2.
CoRR, 2019

Regular p-ary bent functions with five terms and Kloosterman sums.
Cryptogr. Commun., 2019

Some classes of LCD codes and self-orthogonal codes over finite fields.
Adv. Math. Commun., 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. Inf. Theory, 2018

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

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

Linear Codes Over 𝔽<sub>q</sub> Are Equivalent to LCD Codes for q>3.
IEEE Trans. Inf. Theory, 2018

On the Menezes-Teske-Weng's conjecture.
IACR Cryptol. ePrint Arch., 2018

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

Cyclic bent functions and their applications in codes, codebooks, designs, MUBs and sequences.
CoRR, 2018

Several infinite families of <i>p</i>-ary weakly regular bent functions.
Adv. Math. Commun., 2018

Two classes of linear codes and their weight distributions.
Appl. Algebra Eng. Commun. Comput., 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
A Construction of Linear Codes Over 𝔽<sub>2<sup>t</sup></sub> From Boolean Functions.
IEEE Trans. Inf. Theory, 2017

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

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

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

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

On σ-LCD codes.
CoRR, 2017

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

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

A class of hyper-bent functions and Kloosterman sums.
Cryptogr. Commun., 2017

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

Privacy-preserving face recognition with outsourced computation.
Soft Comput., 2016

New verifiable outsourced computation scheme for an arbitrary function.
Int. J. Grid Util. Comput., 2016

Two-Weight and Three-Weight Linear Codes From Square Functions.
IEEE Commun. Lett., 2016

Binary Linear Codes With Few Weights.
IEEE Commun. Lett., 2016

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

Construction of Efficient MDS Matrices Based on Block Circulant Matrices for Lightweight Application.
Fundam. Informaticae, 2016

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

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

2015
Efficient outsourcing schemes of modular exponentiations with checkability for untrusted cloud server.
J. Ambient Intell. Humaniz. Comput., 2015

Securely verifiable outsourcing schemes of matrix calculation.
Int. J. High Perform. Comput. Netw., 2015

Constructing vectorial Boolean functions with high algebraic immunity based on group decomposition.
Int. J. Comput. Math., 2015

A Construction of Linear Codes over $\f_{2^t}$ from Boolean Functions.
CoRR, 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.
Sci. China Inf. Sci., 2015

2014
Privacy-Preserving Face Recognition with Outsourced Computation.
IACR Cryptol. ePrint Arch., 2014

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

Implementing optimized pairings with elliptic nets.
Sci. China Inf. Sci., 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 Cryptol. ePrint Arch., 2013

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

A new class of semi-bent quadratic Boolean functions.
IACR Cryptol. ePrint Arch., 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. Inf. Theory, 2012

Constructing Vectorial Boolean Functions with High Algebraic Immunity Based on Group Decomposition.
IACR Cryptol. ePrint Arch., 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 Cryptol. ePrint Arch., 2011

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

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

Pseudorandom Generators Based on Subcovers for Finite Groups.
Proceedings of the Information Security and Cryptology - 7th International Conference, 2011


  Loading...