Chunming Tang
Orcid: 0000-0001-9599-851XAffiliations:
- China West Normal University, Nanchong, China
According to our database1,
Chunming Tang
authored at least 113 papers
between 2011 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
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
Finite Fields Their Appl., June, 2023
IEEE Trans. Inf. Theory, April, 2023
Finite Fields Their Appl., 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
IEEE Trans. Inf. Theory, 2022
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
An infinite family of antiprimitive cyclic codes supporting Steiner systems S(3, 8, 7<sup>m+1)</sup>.
Des. Codes Cryptogr., 2022
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
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
IEEE Trans. Inf. Theory, 2021
IEEE Trans. Inf. Theory, 2021
IEEE Trans. Inf. Theory, 2021
A Novel Application of Boolean Functions With High Algebraic Immunity in Minimal Codes.
IEEE Trans. Inf. Theory, 2021
IEEE Trans. Inf. Theory, 2021
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
Cryptogr. Commun., 2021
Adv. Math. Commun., 2021
2020
IEEE Trans. Inf. Theory, 2020
New characterizations and construction methods of bent and hyper-bent Boolean functions.
Discret. Math., 2020
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
2019
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
Des. Codes Cryptogr., 2019
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
Cryptogr. Commun., 2019
Adv. Math. Commun., 2019
New quadratic bent functions in polynomial forms with coefficients in extension fields.
Appl. Algebra Eng. Commun. Comput., 2019
2018
IEEE Trans. Inf. Theory, 2018
IEEE Trans. Inf. Theory, 2018
IEEE Trans. Inf. Theory, 2018
Cyclic bent functions and their applications in codes, codebooks, designs, MUBs and sequences.
CoRR, 2018
Adv. Math. Commun., 2018
Appl. Algebra Eng. Commun. Comput., 2018
Two infinite classes of rotation symmetric bent functions with simple representation.
Appl. Algebra Eng. Commun. Comput., 2018
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
IEEE Trans. Inf. Theory, 2017
Des. Codes Cryptogr., 2017
2016
IEEE Trans. Inf. Theory, 2016
Int. J. Grid Util. Comput., 2016
IEEE Commun. Lett., 2016
IACR Cryptol. ePrint Arch., 2016
Construction of Efficient MDS Matrices Based on Block Circulant Matrices for Lightweight Application.
Fundam. Informaticae, 2016
Finite Fields Their Appl., 2016
2015
Efficient outsourcing schemes of modular exponentiations with checkability for untrusted cloud server.
J. Ambient Intell. Humaniz. Comput., 2015
Int. J. High Perform. Comput. Netw., 2015
Constructing vectorial Boolean functions with high algebraic immunity based on group decomposition.
Int. J. Comput. Math., 2015
CoRR, 2015
CoRR, 2015
2014
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
2013
New Quadratic Bent Functions in Polynomial Forms with Coefficients in Extension Fields.
IACR Cryptol. ePrint Arch., 2013
IACR Cryptol. ePrint Arch., 2013
IACR Cryptol. ePrint Arch., 2013
Proceedings of the 2013 IEEE International Conference on Green Computing and Communications (GreenCom) and IEEE Internet of Things (iThings) and IEEE Cyber, 2013
Proceedings of the Information Security and Cryptology - 9th International Conference, 2013
2012
IEEE Trans. Inf. Theory, 2012
Constructing Vectorial Boolean Functions with High Algebraic Immunity Based on Group Decomposition.
IACR Cryptol. ePrint Arch., 2012
2011
Inf. Process. Lett., 2011
IACR Cryptol. ePrint Arch., 2011
IACR Cryptol. ePrint Arch., 2011
Proceedings of the Information Security and Cryptology - 7th International Conference, 2011