Chun-Ming Tang

From MaRDI portal
Revision as of 03:06, 7 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:439449

Available identifiers

zbMath Open tang.chunmingMaRDI QIDQ439449

List of research outcomes





PublicationDate of PublicationType
Controlling and optimizing the transport (search) efficiency with local information on a class of scale-free trees2025-01-14Paper
Constructions of optimal Z-periodic complementary sequence sets with large zero correlation zone2024-12-03Paper
Large sets of binary spreading sequences with low correlation and low PAPR via gold functions2024-07-23Paper
Some quantum MDS codes from GRS codes2024-06-25Paper
New construction of optimal ZCZ sequence sets with inter-set zero cross-correlation zone2024-05-22Paper
Large optimal cyclic subspace codes2024-05-21Paper
Infinite Families of Cyclic and Negacyclic Codes Supporting 3-Designs2024-03-19Paper
Binary [n, (n + 1)/2 Cyclic Codes With Good Minimum Distances]2024-03-14Paper
Codes and pseudo-geometric designs from the ternary \(m\)-sequences with Welch-type decimation \(d = 2 \cdot 3^{(n -1)/2} + 1\)2024-01-29Paper
Hierarchical identity-based inner product functional encryption2023-12-11Paper
The projective general linear group \(\mathrm{PGL}(2, 5^m)\) and linear codes of length \(5^m+1\)2023-08-10Paper
New constructions of Sidon spaces and large cyclic constant dimension codes2023-07-20Paper
Möbius transformations and characterizations of hyper-bent functions from Dillon-like exponents with coefficients in extension fields2023-07-07Paper
Some shortened codes from linear codes constructed by defining sets2023-07-07Paper
Some 3-designs and shortened codes from binary cyclic codes with three zeros2023-06-19Paper
The solution to an open problem on the bentness of Mesnager's functions2023-04-27Paper
A hybrid Riemannian conjugate gradient method for nonconvex optimization problems2023-04-20Paper
On Constructions and Enumeration of Vectorial Hyper-bent Functions in the $\cP\cS_{ap}^{\#}$ Class2023-03-02Paper
Some new constructions of optimal asymmetric quantum codes2023-02-24Paper
https://portal.mardi4nfdi.de/entity/Q58731222023-02-09Paper
Further constructions of large cyclic subspace codes via Sidon spaces2023-02-01Paper
Constructions of large cyclic constant dimension codes via Sidon spaces2023-01-18Paper
The minimum locality of linear codes2023-01-18Paper
Some constructions of optimal subsystem codes derived from GRS codes2022-12-06Paper
Some entanglement-assisted quantum MDS codes with large minimum distance2022-12-06Paper
Application of GRS codes to some entanglement-assisted quantum MDS codes2022-11-29Paper
New constructions of optimal subsystem codes2022-11-01Paper
A new restricted memory level bundle method for constrained convex nonsmooth optimization2022-10-11Paper
The Subfield Codes and Subfield Subcodes of a Family of MDS Codes2022-10-11Paper
https://portal.mardi4nfdi.de/entity/Q50379592022-09-29Paper
A family of inertial derivative-free projection methods for constrained nonlinear pseudo-monotone equations with applications2022-09-26Paper
A weak Galerkin finite element method for indefinite time-harmonic Maxwell equations2022-09-21Paper
A class of twisted generalized Reed-Solomon codes2022-07-13Paper
On Infinite Families of Narrow-Sense Antiprimitive BCH Codes Admitting 3-Transitive Automorphism Groups and Their Consequences2022-07-13Paper
Shortened Linear Codes From APN and PN Functions2022-07-13Paper
A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization2022-06-27Paper
A sequential quadratic programming algorithm without a penalty function, a filter or a constraint qualification for inequality constrained optimization2022-06-27Paper
An infinite family of antiprimitive cyclic codes supporting Steiner systems \(S(3,8, 7^m+1)\)2022-06-08Paper
Infinite families of 2-designs from linear codes2022-05-23Paper
https://portal.mardi4nfdi.de/entity/Q50704152022-04-11Paper
The linear codes of \(t\)-designs held in the Reed-Muller and simplex codes2022-04-01Paper
A feasible descent bundle method for inequality constrained Minimax problems2022-03-21Paper
Efficient Explicit Constructions of Multipartite Secret Sharing Schemes2022-02-17Paper
Infinite families of 2-designs from two classes of binary cyclic codes with three nonzeros2022-01-24Paper
Least-squares-based three-term conjugate gradient methods2022-01-20Paper
Designs from Linear Codes2022-01-13Paper
Infinite families of 3-designs from o-polynomials2021-12-18Paper
An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems2021-12-15Paper
Design of a model-free adaptive sliding mode control to synchronize chaotic fractional-order systems with input saturation: an application in secure communications2021-10-21Paper
An infinite family of antiprimitive cyclic codes supporting Steiner systems $S(3,8, 7^m+1)$2021-10-07Paper
An Open Problem on the Bentness of Mesnager's Functions2021-09-27Paper
Shortened Linear Codes Over Finite Fields2021-09-07Paper
Trapping efficiency of random walks on weighted scale-free trees2021-08-17Paper
Cyclic Bent Functions and Their Applications in Sequences2021-07-23Paper
Full Characterization of Minimal Linear Codes as Cutting Blocking Sets2021-07-23Paper
Fast Algebraic Immunity of Boolean Functions and LCD Codes2021-07-23Paper
Combinatorial \(t\)-designs from special functions2021-07-13Paper
The projective general linear group \(\mathrm{PGL}(2,2^m)\) and linear codes of length \(2^m+1\)2021-06-24Paper
The subfield codes and subfield subcodes of a family of MDS codes2021-06-14Paper
A construction of \(p\)-ary linear codes with two or three weights2021-05-12Paper
A new class of \(p\)-ary regular bent functions2021-05-12Paper
Simplified Bounds on FHSs Set and Its Strictly Optimal Construction2021-04-19Paper
Finding the maximal adversary structure from any given access structure2021-03-18Paper
An Infinite Family of Linear Codes Supporting 4-Designs2021-02-22Paper
On the boomerang uniformity of quadratic permutations2020-10-07Paper
Codes, Differentially $\delta$ -Uniform Functions, and $t$ -Designs2020-09-29Paper
Minimal Linear Codes From Characteristic Functions2020-09-29Paper
Infinite Families of Near MDS Codes Holding t-Designs2020-09-29Paper
New characterizations and construction methods of bent and hyper-bent Boolean functions2020-09-10Paper
On the Menezes-Teske-Weng conjecture2020-05-12Paper
A multi-step doubly stabilized bundle method for nonsmooth convex optimization2020-05-06Paper
Efficient explicit constructions of multipartite secret sharing schemes2020-05-05Paper
Linear codes of 2-designs associated with subcodes of the ternary generalized Reed-Muller codes2020-03-27Paper
A class of narrow-sense BCH codes over \(\mathbb{F}_q\) of length \(\frac{q^m-1}{2} \)2020-01-31Paper
Codebooks from generalized bent \(\mathbb{Z}_4\)-valued quadratic forms2020-01-22Paper
Steiner systems \(S(2, 4, \frac{3^m-1}{2})\) and 2-designs from ternary linear codes of length \(\frac{3^m-1}{2}\)2019-11-07Paper
Efficient explicit constructions of compartmented secret sharing schemes2019-11-07Paper
Further study on the maximum number of bent components of vectorial functions2019-10-17Paper
Regular \(p\)-ary bent functions with five terms and Kloosterman sums2019-09-25Paper
New quadratic bent functions in polynomial forms with coefficients in extension fields2019-08-27Paper
A Center-Point Algorithm for Unit Commitment with Carbon Emission Trading2019-07-30Paper
A proximal-projection partial bundle method for convex constrained minimax problems2019-07-23Paper
More cyclotomic constructions of optimal frequency-hopping sequences2019-07-04Paper
Some classes of LCD codes and self-orthogonal codes over finite fields2019-05-21Paper
On $\sigma$ -LCD Codes2019-03-28Paper
A new family of optimal FHS sets with composite lengths2019-03-25Paper
Combinatorial $t$-designs from special polynomials2019-03-18Paper
Infinite families of $2$-designs from two classes of linear codes2019-03-18Paper
A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization2019-03-15Paper
Two classes of optimal frequency-hopping sequences with new parameters2019-03-15Paper
https://portal.mardi4nfdi.de/entity/Q46244532019-02-22Paper
Binary LCD Codes and Self-Orthogonal Codes From a Generic Construction2019-01-18Paper
New Characterization and Parametrization of LCD Codes2019-01-18Paper
Explicit characterization of two classes of regular bent functions2018-12-19Paper
Euclidean and Hermitian LCD MDS codes2018-10-10Paper
Several infinite families of \(p\)-ary weakly regular bent functions2018-09-21Paper
Further Results on Generalized Bent Functions and Their Complete Characterization2018-09-19Paper
Optimal FHSs and DSSs via near zero-difference balanced functions2018-09-06Paper
https://portal.mardi4nfdi.de/entity/Q31755802018-07-18Paper
https://portal.mardi4nfdi.de/entity/Q45708682018-07-09Paper
https://portal.mardi4nfdi.de/entity/Q45708702018-07-09Paper
Generalized Plateaued Functions and Admissible (Plateaued) Functions2018-06-27Paper
Generic Construction of Bent Functions and Bent Idempotents With Any Possible Algebraic Degrees2018-06-27Paper
Complementary Dual Algebraic Geometry Codes2018-06-27Paper
Two infinite classes of rotation symmetric bent functions with simple representation2018-06-26Paper
Two classes of linear codes and their weight distributions2018-06-26Paper
A feasible point method with bundle modification for nonsmooth convex constrained optimization2018-05-29Paper
A method to enlarge the design distance of BCH codes and some classes of infinite optimal cyclic codes2018-04-20Paper
Privacy-preserving outsourcing of image feature extraction in cloud computing2018-02-27Paper
A construction of linear codes and their complete weight enumerators2017-10-05Paper
Complete Characterization of Generalized Bent and 2k-Bent Boolean Functions2017-09-21Paper
Construction of Efficient MDS Matrices Based on Block Circulant Matrices for Lightweight Application2017-07-28Paper
The Weight Distributions of Cyclic Codes and Elliptic Curves2017-06-08Paper
A Construction of Linear Codes Over ${\mathbb {F}}_{2^t}$ From Boolean Functions2017-05-02Paper
Linear Codes With Two or Three Weights From Weakly Regular Bent Functions2017-04-28Paper
Linear codes with few weights from inhomogeneous quadratic functions2017-04-12Paper
A class of hyper-bent functions and Kloosterman sums2017-04-03Paper
https://portal.mardi4nfdi.de/entity/Q31804032017-01-06Paper
A class of linear codes with a few weights2017-01-05Paper
Special values of Kloosterman sums and binomial bent functions2016-07-29Paper
https://portal.mardi4nfdi.de/entity/Q34614302016-01-15Paper
A Note on Semi-bent and Hyper-bent Boolean Functions2015-12-02Paper
Implementing optimized pairings with elliptic nets2015-11-20Paper
https://portal.mardi4nfdi.de/entity/Q31943742015-10-28Paper
https://portal.mardi4nfdi.de/entity/Q31958672015-10-28Paper
Constructing Hyper-Bent Functions from Boolean Functions with the Walsh Spectrum Taking the Same Value Twice2015-09-09Paper
Cryptography on twisted Edwards curves over local fields2015-08-05Paper
Constructing vectorial Boolean functions with high algebraic immunity based on group decomposition2015-06-24Paper
Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems2014-12-12Paper
The complexity and randomness of linear multi-secret sharing schemes with non-threshold structures2014-12-09Paper
Several cryptographic applications of \(\Sigma\)-protocol2014-11-21Paper
A note on cyclic codes from APN functions2014-10-02Paper
A New Model of Binary Elliptic Curves2014-08-20Paper
A new superlinearly convergent algorithm of combining QP subproblem with system of linear equations for nonlinear optimization2014-07-31Paper
https://portal.mardi4nfdi.de/entity/Q49805072014-06-30Paper
Chosen-ciphertext secure multi-hop identity-based conditional proxy re-encryption with constant-size ciphertexts2014-06-06Paper
A note on ramp secret sharing schemes from error-correcting codes2014-05-14Paper
Efficient integer span program for hierarchical threshold access structure2014-04-11Paper
The optimal linear secret sharing scheme for any given access structure2014-03-18Paper
A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization2014-01-24Paper
https://portal.mardi4nfdi.de/entity/Q28601872013-11-19Paper
An ID-based authenticated dynamic group key agreement with optimal round2013-08-20Paper
A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization2013-07-24Paper
Secure multi-party computation protocol for sequencing problem2013-07-03Paper
https://portal.mardi4nfdi.de/entity/Q49269822013-06-20Paper
A CCA-Secure Identity-Based Conditional Proxy Re-Encryption without Random Oracles2013-06-04Paper
Faster pairing computation on genus \(2\) hyperelliptic curves2013-03-28Paper
https://portal.mardi4nfdi.de/entity/Q49018232013-01-24Paper
Pseudorandom Generators Based on Subcovers for Finite Groups2013-01-07Paper
https://portal.mardi4nfdi.de/entity/Q29159292012-10-05Paper
Leakproof secret sharing protocols with applications to group identification scheme2012-08-17Paper
Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions2012-08-16Paper
A working set SQCQP algorithm with simple nonmonotone penalty parameters2011-12-21Paper
https://portal.mardi4nfdi.de/entity/Q31707492011-09-29Paper
https://portal.mardi4nfdi.de/entity/Q31707502011-09-29Paper
https://portal.mardi4nfdi.de/entity/Q31707522011-09-29Paper
https://portal.mardi4nfdi.de/entity/Q30174742011-07-19Paper
Inverse problems and solution methods for a class of nonlinear complementarity problems2011-06-03Paper
Two new predictor-corrector algorithms for second-order cone programming2011-05-19Paper
https://portal.mardi4nfdi.de/entity/Q30521642010-11-05Paper
https://portal.mardi4nfdi.de/entity/Q35738652010-07-08Paper
A new norm-relaxed SQP algorithm with global convergence2010-05-21Paper
Error bound results for generalized D-gap functions of nonsmooth variational inequality problems2010-03-04Paper
Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions2009-12-10Paper
https://portal.mardi4nfdi.de/entity/Q36403872009-11-11Paper
https://portal.mardi4nfdi.de/entity/Q53196182009-07-22Paper
Divisible On-Line/Off-Line Signatures2009-04-29Paper
On a separation principle for nonconvex sets2009-03-16Paper
A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization2009-01-07Paper
A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function2008-08-22Paper
A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization2008-06-12Paper
Delegateable signatures based on non-interactive witness indistinguishable and non-interactive witness hiding proofs2008-04-15Paper
A sequential quadratically constrained quadratic programming method of feasible directions2008-04-03Paper
A generalized super-memory gradient projection method of strongly sub-feasible directions with strong convergence for nonlinear inequality constrained optimization2007-11-12Paper
A new version of the Liu-Storey conjugate gradient method2007-09-17Paper
Semilocal E-convexity and semilocal E-convex programming2007-04-26Paper
New conjugacy condition and related new conjugate gradient methods for unconstrained optimization2007-04-13Paper
A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization2007-01-11Paper
https://portal.mardi4nfdi.de/entity/Q54684132006-05-26Paper
A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization2005-11-04Paper
https://portal.mardi4nfdi.de/entity/Q56980552005-10-27Paper
An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity2005-08-04Paper
A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity2005-06-13Paper
https://portal.mardi4nfdi.de/entity/Q48238472004-10-28Paper
https://portal.mardi4nfdi.de/entity/Q48184322004-09-28Paper

Research outcomes over time

This page was built for person: Chun-Ming Tang