The following pages link to Chun-Ming Tang (Q439449):
Displaying 50 items.
- New constructions of optimal subsystem codes (Q2091365) (← links)
- Some constructions of optimal subsystem codes derived from GRS codes (Q2101560) (← links)
- Some entanglement-assisted quantum MDS codes with large minimum distance (Q2101590) (← links)
- Application of GRS codes to some entanglement-assisted quantum MDS codes (Q2107025) (← links)
- The linear codes of \(t\)-designs held in the Reed-Muller and simplex codes (Q2121020) (← links)
- Infinite families of 2-designs from linear codes (Q2140830) (← links)
- A class of twisted generalized Reed-Solomon codes (Q2153755) (← links)
- Efficient explicit constructions of multipartite secret sharing schemes (Q2176663) (← links)
- A multi-step doubly stabilized bundle method for nonsmooth convex optimization (Q2177698) (← links)
- On the Menezes-Teske-Weng conjecture (Q2179501) (← links)
- New characterizations and construction methods of bent and hyper-bent Boolean functions (Q2198402) (← links)
- Design of a model-free adaptive sliding mode control to synchronize chaotic fractional-order systems with input saturation: an application in secure communications (Q2235419) (← links)
- Codebooks from generalized bent \(\mathbb{Z}_4\)-valued quadratic forms (Q2286597) (← links)
- A class of narrow-sense BCH codes over \(\mathbb{F}_q\) of length \(\frac{q^m-1}{2} \) (Q2291669) (← links)
- Linear codes of 2-designs associated with subcodes of the ternary generalized Reed-Muller codes (Q2306902) (← links)
- More cyclotomic constructions of optimal frequency-hopping sequences (Q2311602) (← links)
- A proximal-projection partial bundle method for convex constrained minimax problems (Q2313762) (← links)
- New quadratic bent functions in polynomial forms with coefficients in extension fields (Q2321948) (← links)
- Regular \(p\)-ary bent functions with five terms and Kloosterman sums (Q2325310) (← links)
- Further study on the maximum number of bent components of vectorial functions (Q2329400) (← links)
- Steiner systems \(S(2, 4, \frac{3^m-1}{2})\) and 2-designs from ternary linear codes of length \(\frac{3^m-1}{2}\) (Q2334438) (← links)
- Efficient explicit constructions of compartmented secret sharing schemes (Q2334444) (← links)
- A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization (Q2378276) (← links)
- A new version of the Liu-Storey conjugate gradient method (Q2381321) (← links)
- A construction of linear codes and their complete weight enumerators (Q2406684) (← links)
- Some classes of LCD codes and self-orthogonal codes over finite fields (Q2415390) (← links)
- The optimal linear secret sharing scheme for any given access structure (Q2440328) (← links)
- Efficient integer span program for hierarchical threshold access structure (Q2444853) (← links)
- A note on ramp secret sharing schemes from error-correcting codes (Q2450506) (← links)
- Chosen-ciphertext secure multi-hop identity-based conditional proxy re-encryption with constant-size ciphertexts (Q2453123) (← links)
- A generalized super-memory gradient projection method of strongly sub-feasible directions with strong convergence for nonlinear inequality constrained optimization (Q2460608) (← links)
- A sequential quadratically constrained quadratic programming method of feasible directions (Q2480785) (← links)
- Delegateable signatures based on non-interactive witness indistinguishable and non-interactive witness hiding proofs (Q2481774) (← links)
- An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity (Q2485397) (← links)
- A new superlinearly convergent algorithm of combining QP subproblem with system of linear equations for nonlinear optimization (Q2510002) (← links)
- Cryptography on twisted Edwards curves over local fields (Q2515455) (← links)
- A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization (Q2572648) (← links)
- An infinite family of antiprimitive cyclic codes supporting Steiner systems \(S(3,8, 7^m+1)\) (Q2672291) (← links)
- A weak Galerkin finite element method for indefinite time-harmonic Maxwell equations (Q2673933) (← links)
- A family of inertial derivative-free projection methods for constrained nonlinear pseudo-monotone equations with applications (Q2675781) (← links)
- Constructions of large cyclic constant dimension codes via Sidon spaces (Q2678973) (← links)
- The minimum locality of linear codes (Q2678979) (← links)
- Further constructions of large cyclic subspace codes via Sidon spaces (Q2682851) (← links)
- Some new constructions of optimal asymmetric quantum codes (Q2686248) (← links)
- A hybrid Riemannian conjugate gradient method for nonconvex optimization problems (Q2700130) (← links)
- The solution to an open problem on the bentness of Mesnager's functions (Q2701045) (← links)
- A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization (Q2841139) (← links)
- (Q2860187) (← links)
- A New Model of Binary Elliptic Curves (Q2876949) (← links)
- (Q2915929) (← links)
