Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Tidjani Négadi
Georgiy Elfond
Jhonathan Pinzon
Liangliang Shang
Wenjun Ma
Kazi Saif Islam
Giovanni Venturelli
Chen Ma
Jing-Sheng Wong
Radu Timofte
Home
/
Author
/
CHAOPING XING
Author Info
Open Visualization
Name
Affiliation
Papers
CHAOPING XING
National University of Singapore, Department of Mathematics, 2 Science Drive 2, 117543, Singapore, Singapore
150
Collaborators
Citations
PageRank
100
916
110.47
Referers
Referees
References
1136
875
956
Search Limit
100
1000
Publications (100 rows)
Collaborators (100 rows)
Referers (100 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
More Efficient Dishonest Majority Secure Computation over ℤ 2 k via Galois Rings.
0
0.34
2022
A new framework for deniable secure key exchange
0
0.34
2022
Construction of Optimal (<italic>r</italic>, δ)-Locally Recoverable Codes and Connection With Graph Theory
0
0.34
2022
Biometric key generation based on generated intervals and two-layer error correcting technique
0
0.34
2021
Improved Single-Round Secure Multiplication Using Regenerating Codes.
0
0.34
2021
A New Construction of Nonlinear Codes via Rational Function Fields
0
0.34
2021
Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over $\mathbb {Z}/p^k\mathbb {Z} $.
0
0.34
2020
Construction of Optimal Locally Repairable Codes via Automorphism Groups of Rational Function Fields
6
0.47
2020
A Secure Federated Transfer Learning Framework
12
0.66
2020
Efficient Multi-Point Local Decoding of Reed-Muller Codes via Interleaved Codex
0
0.34
2020
Beating the probabilistic lower bound on perfect hashing
0
0.34
2019
Secure And Efficient Federated Transfer Learning
0
0.34
2019
Reducing the Key Size of McEliece Cryptosystem from Automorphism-induced Goppa Codes via Permutations.
0
0.34
2019
Amortized Complexity of Information-Theoretically Secure MPC Revisited.
0
0.34
2018
List Decoding of Cover Metric Codes Up to the Singleton Bound.
0
0.34
2018
Asymptotic Gilbert-Varshamov bound on Frequency Hopping.
0
0.34
2018
A Construction of Optimal Frequency Hopping Sequence Set via Combination of Multiplicative and Additive Groups of Finite Fields
2
0.40
2018
New extension constructions of optimal frequency hopping sequence sets.
0
0.34
2018
Construction of optimal locally recoverable codes and connection with hypergraph.
1
0.35
2018
List Decodability of Symbol-Pair Codes.
1
0.35
2018
Algebraic geometry codes with complementary duals exceed the asymptotic Gilbert-Varshamov bound.
2
0.39
2018
SPD \mathbb Z_2^k : Efficient MPC mod 2^k for Dishonest Majority.
0
0.34
2018
Efficiently repairing algebraic geometry codes.
1
0.36
2017
Subspace Designs based on Algebraic Function Fields.
1
0.35
2017
Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes
1
0.37
2017
List Decodability of Random Subcodes of Gabidulin Codes.
2
0.41
2017
New MDS Self-Dual Codes from Generalized Reed-Solomon Codes.
9
0.92
2017
Construction of Sequences With High Nonlinear Complexity From Function Fields.
1
0.36
2017
Efficiently List-Decodable Punctured Reed-Muller Codes.
0
0.34
2017
Explicit List-Decodable Rank-Metric and Subspace Codes via Subspace Designs.
5
0.44
2016
New Binary Codes From Rational Function Fields
1
0.63
2015
Optimal rate list decoding of folded algebraic-geometric codes over constant-sized alphabets
5
0.45
2014
Torsion Limits and Riemann-Roch Systems for Function Fields and Applications
8
0.59
2014
A relation between embedding degrees and class numbers of binary quadratic forms.
0
0.34
2014
Sequences With High Nonlinear Complexity
7
0.52
2014
Erasure List-Decodable Codes From Random and Algebraic Geometry Codes
1
0.37
2014
Hitting Sets for Low-Degree Polynomials with Optimal Density
2
0.37
2013
On secret sharing with nonlinear product reconstruction.
0
0.34
2013
New results on two hypercube coloring problems
3
0.49
2013
A Construction of New Quantum MDS Codes
19
0.88
2013
Towards a characterization of subfields of the Deligne-Lusztig function fields.
2
0.62
2013
Euclidean and Hermitian Self-Orthogonal Algebraic Geometry Codes and Their Application to Quantum Codes
11
0.64
2013
On the Representability of the Biuniform Matroid.
1
0.35
2013
Cumulative Distance Enumerators of Random Codes and their Thresholds
1
0.38
2012
The arithmetic codex
2
0.38
2012
Asymptotic Bound for Multiplication Complexity in the Extensions of Small Finite Fields.
7
0.62
2012
Private (t,n) Threshold Searching on Streaming Data
3
0.42
2012
Bounds on the Threshold Gap in Secret Sharing over Small Fields.
0
0.34
2012
Good Linear Codes from Polynomial Evaluations.
3
0.46
2012
List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound
31
1.20
2012
1
2
50 / page
