default search action
Chen Yuan 0003
Person information
- affiliation: Shanghai Jiao Tong University, School of Electronic Information and Electrical Engineering, China
- affiliation (former): CWI, Amsterdam, The Netherlands
- affiliation (PhD 2018 (Math)): Nanyang Technological University, Singapore
- affiliation (PhD 2013 (CS)): Fudan University, China
Other persons with the same name
- Chen Yuan 0001
— Global Energy Interconnection Research Institute North America, San Jose, CA, USA (and 2 more)
- Chen Yuan 0002 — University at Buffalo, NY, USA (and 1 more)
- Chen Yuan 0004 — Toyo University, Kawagoe, Japan
- Chen Yuan 0005 — National University of Singapore, Singapore
- Chen Yuan 0006
- Chen Yuan 0007 — East China Normal University, Shanghai, China
- Chen Yuan 0008 — Concordia University, Montreal, Canada
- Chen Yuan 0009 — City University of Hong Kong, Hong Kong, SAR, China
- Chen Yuan 0010 — Beijing University of Posts and Telecommunications Beijing, China
- Chen Yuan 0011 — Hubei University of Technology, Wuhan, China
- Chen Yuan 0012 — Sun Yat-sen University, School of Data and Computer Science, Guangzhou, China
- Chen Yuan 0013 — East China University of Science and Technology, MoE Key Laboratory of Smart Manufacturing in Energy Chemical Process, Shanghai, China
- Chen Yuan 0014
- Chen Yuan 0015 — Central South University, School of Traffic and Transportation Engineering, Changsha, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j29]Shu Liu
On Lengths of Singleton-Optimal Locally Repairable Codes. IEEE Trans. Commun. 72(1): 3-12 (2024) - [j28]Chaoping Xing
Evolving Secret Sharing Schemes Based on Polynomial Evaluations and Algebraic Geometry Codes. IEEE Trans. Inf. Theory 70(5): 3718-3728 (2024) - [j27]Nicolas Resch
Threshold Rates of Code Ensembles: Linear Is Best. IEEE Trans. Inf. Theory 70(7): 4823-4842 (2024) - [j26]Nicolas Resch
Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery. IEEE Trans. Inf. Theory 70(9): 6211-6238 (2024) - [i36]Jonathan Mosheiff, Nicolas Resch, Kuo Shang, Chen Yuan:
Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes. CoRR abs/2402.11533 (2024) - [i35]Zeyu Guo, Chaoping Xing, Chen Yuan, Zihan Zhang:
Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric. CoRR abs/2404.13230 (2024) - 2023
- [j25]Chaoping Xing, Chen Yuan:
Beating the Probabilistic Lower Bound on q-Perfect Hashing. Comb. 43(2): 347-366 (2023) - [j24]Keqin Feng, Lingfei Jin
Constructions of k-Uniform States in Heterogeneous Systems. IEEE Trans. Inf. Theory 69(9): 5845-5856 (2023) - [c21]Fuchun Lin, Chaoping Xing, Yizhou Yao, Chen Yuan:
Amortized NISC over $\mathbb {Z}_{2^k}$ from RMFE. ASIACRYPT (1) 2023: 38-70 - [c20]Daniel Escudero, Cheng Hong, Hongqing Liu, Chaoping Xing, Chen Yuan:
Degree-D Reverse Multiplication-Friendly Embeddings: Constructions and Applications. ASIACRYPT (1) 2023: 106-138 - [c19]Hongqing Liu, Chaoping Xing, Yanjiang Yang, Chen Yuan:
Ramp Hyper-invertible Matrices and Their Applications to MPC Protocols. ASIACRYPT (1) 2023: 204-236 - [c18]Nicolas Resch
Two-Round Perfectly Secure Message Transmission with Optimal Transmission Rate. ITC 2023: 1:1-1:20 - [c17]Shu Liu, Chaoping Xing, Chen Yuan:
List Decoding of Rank-Metric Codes with Row-To-Column Ratio Bigger Than 1/2. ICALP 2023: 89:1-89:14 - [c16]Nicolas Resch
Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery. ICALP 2023: 99:1-99:18 - [i34]Keqin Feng, Lingfei Jin, Chaoping Xing, Chen Yuan:
Constructions of k-uniform states in heterogeneous systems. CoRR abs/2305.12769 (2023) - [i33]Nicolas Resch, Chen Yuan, Yihan Zhang:
Tight Bounds on List-Decodable and List-Recoverable Zero-Rate Codes. CoRR abs/2309.01800 (2023) - [i32]Daniel Escudero, Hongqing Liu, Chaoping Xing, Chen Yuan:
Degree-D Reverse Multiplication-Friendly Embeddings: Constructions and Applications. IACR Cryptol. ePrint Arch. 2023: 173 (2023) - [i31]Fuchun Lin, Chaoping Xing, Yizhou Yao, Chen Yuan:
Amortized NISC over ℤ2k from RMFE. IACR Cryptol. ePrint Arch. 2023: 1363 (2023) - [i30]Hongqing Liu, Chaoping Xing, Yanjiang Yang, Chen Yuan:
Ramp hyper-invertible matrices and their applications to MPC protocols. IACR Cryptol. ePrint Arch. 2023: 1369 (2023) - [i29]Hongqing Liu, Chaoping Xing, Chen Yuan, Taoxu Zou:
Dishonest Majority Multiparty Computation over Matrix Rings. IACR Cryptol. ePrint Arch. 2023: 1912 (2023) - 2022
- [j23]Chaoping Xing
Construction of Optimal (r, δ)-Locally Recoverable Codes and Connection With Graph Theory. IEEE Trans. Inf. Theory 68(7): 4320-4328 (2022) - [c15]Daniel Escudero, Chaoping Xing, Chen Yuan:
More Efficient Dishonest Majority Secure Computation over $\mathbb {Z}_{2^k}$ via Galois Rings. CRYPTO (1) 2022: 383-412 - [c14]Nicolas Resch
Threshold Rates of Code Ensembles: Linear Is Best. ICALP 2022: 104:1-104:19 - [i28]Nicolas Resch
Threshold Rates of Codes Ensembles: Linear is Best. CoRR abs/2205.01513 (2022) - [i27]Shu Liu, Tingyi Wu, Chaoping Xing, Chen Yuan:
Upper bounds on maximum lengths of Singleton-optimal locally repairable codes. CoRR abs/2207.05417 (2022) - [i26]Nicolas Resch, Chen Yuan, Yihan Zhang:
Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery. CoRR abs/2210.07754 (2022) - [i25]Daniel Escudero, Chaoping Xing, Chen Yuan:
More Efficient Dishonest Majority Secure Computation over ℤ2k via Galois Rings. IACR Cryptol. ePrint Arch. 2022: 815 (2022) - 2021
- [c13]Chaoping Xing, Chen Yuan:
Beating the probabilistic lower bound on perfect hashing. SODA 2021: 33-41 - [i24]Nicolas Resch, Chen Yuan:
Two-Round Perfectly Secure Message Transmission with Optimal Transmission Rate. IACR Cryptol. ePrint Arch. 2021: 158 (2021) - [i23]Chaoping Xing, Chen Yuan:
Evolving Secret Sharing Schemes Based on Polynomial Evaluations and Algebraic Geometry Codes. IACR Cryptol. ePrint Arch. 2021: 1115 (2021) - 2020
- [j22]Ronald Cramer, Chaoping Xing
Efficient Multi-Point Local Decoding of Reed-Muller Codes via Interleaved Codex. IEEE Trans. Inf. Theory 66(1): 263-272 (2020) - [j21]Xianhua Niu
Asymptotic Gilbert-Varshamov Bound on Frequency Hopping Sequences. IEEE Trans. Inf. Theory 66(2): 1213-1218 (2020) - [c12]Mark Abspoel, Ronald Cramer, Ivan Damgård, Daniel Escudero, Matthieu Rambaud, Chaoping Xing, Chen Yuan:
Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over $\mathbb {Z}/p^k\mathbb {Z} $. ASIACRYPT (3) 2020: 151-180 - [c11]Ronald Cramer, Chaoping Xing, Chen Yuan:
On the Complexity of Arithmetic Secret Sharing. TCC (3) 2020: 444-469 - [c10]Serge Fehr, Chen Yuan:
Robust Secret Sharing with Almost Optimal Share Size and Security Against Rushing Adversaries. TCC (3) 2020: 470-498 - [i22]Mark Abspoel, Ronald Cramer, Ivan Damgård, Daniel Escudero, Matthieu Rambaud, Chaoping Xing, Chen Yuan:
Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over Z/p^k Z. IACR Cryptol. ePrint Arch. 2020: 1256 (2020)
2010 – 2019
- 2019
- [j20]Yuan Luo
Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes. IEEE Trans. Inf. Theory 65(2): 1048-1053 (2019) - [j19]Venkatesan Guruswami
How Long Can Optimal Locally Repairable Codes Be? IEEE Trans. Inf. Theory 65(6): 3662-3670 (2019) - [j18]Shu Liu, Chaoping Xing
List Decodability of Symbol-Pair Codes. IEEE Trans. Inf. Theory 65(8): 4815-4821 (2019) - [c9]Serge Fehr, Chen Yuan:
Towards Optimal Robust Secret Sharing with Security Against a Rushing Adversary. EUROCRYPT (3) 2019: 472-499 - [c8]Chaoping Xing
Construction of Optimal Locally Recoverable Codes and Connection with Hypergraph. ICALP 2019: 98:1-98:13 - [c7]Mark Abspoel, Ronald Cramer, Ivan Damgård, Daniel Escudero, Chen Yuan:
Efficient Information-Theoretic Secure Multiparty Computation over Z/pkZ via Galois Rings. TCC (1) 2019: 471-501 - [i21]Chaoping Xing, Chen Yuan:
Beating the probabilistic lower bound on perfect hashing. CoRR abs/1908.08792 (2019) - [i20]Chaoping Xing, Chen Yuan:
Beating the probabilistic lower bound on perfect hashing. Electron. Colloquium Comput. Complex. TR19 (2019) - [i19]Serge Fehr, Chen Yuan:
Towards optimal robust secret sharing with security against a rushing adversary. IACR Cryptol. ePrint Arch. 2019: 246 (2019) - [i18]Mark Abspoel, Ronald Cramer, Ivan Damgård, Daniel Escudero, Chen Yuan:
Efficient Information-Theoretic Secure Multiparty Computation over ℤ/pk ℤ via Galois Rings. IACR Cryptol. ePrint Arch. 2019: 872 (2019) - [i17]Ronald Cramer, Chaoping Xing, Chen Yuan:
On the Complexity of Arithmetic Secret Sharing. IACR Cryptol. ePrint Arch. 2019: 1137 (2019) - [i16]Serge Fehr, Chen Yuan:
Robust Secret Sharing with Optimal Share Size and Security Against Rushing Adversaries. IACR Cryptol. ePrint Arch. 2019: 1182 (2019) - 2018
- [j17]Shu Liu, Chaoping Xing
List Decoding of Cover Metric Codes Up to the Singleton Bound. IEEE Trans. Inf. Theory 64(4): 2410-2416 (2018) - [j16]Chaoping Xing
A New Class of Rank-Metric Codes and Their List Decoding Beyond the Unique Decoding Radius. IEEE Trans. Inf. Theory 64(5): 3394-3402 (2018) - [c6]Venkatesan Guruswami, Chaoping Xing, Chen Yuan
How Long Can Optimal Locally Repairable Codes Be?. APPROX-RANDOM 2018: 41:1-41:11 - [c5]Ignacio Cascudo
Amortized Complexity of Information-Theoretically Secure MPC Revisited. CRYPTO (3) 2018: 395-426 - [i15]Yuan Luo, Chaoping Xing, Chen Yuan:
Optimal locally repairable codes of distance 3 and 4 via cyclic codes. CoRR abs/1801.03623 (2018) - [i14]Shu Liu, Chaoping Xing, Chen Yuan:
List Decodability of Symbol-Pair Codes. CoRR abs/1806.08992 (2018) - [i13]Venkatesan Guruswami, Chaoping Xing, Chen Yuan:
How long can optimal locally repairable codes be? CoRR abs/1807.01064 (2018) - [i12]Xianhua Niu, Chaoping Xing, Chen Yuan:
Asymptotic Gilbert-Varshamov bound on Frequency Hopping. CoRR abs/1810.11757 (2018) - [i11]Chaoping Xing, Chen Yuan:
Construction of optimal locally recoverable codes and connection with hypergraph. CoRR abs/1811.09142 (2018) - [i10]Ignacio Cascudo, Ronald Cramer, Chaoping Xing, Chen Yuan:
Amortized Complexity of Information-Theoretically Secure MPC Revisited. IACR Cryptol. ePrint Arch. 2018: 429 (2018) - 2017
- [j15]Ya-Li Liu, Chen Yuan:
Linear Tail-Biting Trellis and Its Sectionalization. J. Inf. Sci. Eng. 33(2): 571-581 (2017) - [j14]Shu Liu, Chaoping Xing
List Decodability of Random Subcodes of Gabidulin Codes. IEEE Trans. Inf. Theory 63(1): 159-163 (2017) - [j13]Keqin Feng, Lingfei Jin
Multipartite Entangled States, Symmetric Matrices, and Error-Correcting Codes. IEEE Trans. Inf. Theory 63(9): 5618-5627 (2017) - [c4]Ronald Cramer, Ivan Damgård, Chaoping Xing, Chen Yuan:
Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack. EUROCRYPT (1) 2017: 479-500 - [c3]Venkatesan Guruswami, Chaoping Xing, Chen Yuan
Subspace Designs Based on Algebraic Function Fields. ICALP 2017: 86:1-86:10 - [i9]Venkatesan Guruswami, Chaoping Xing, Chen Yuan:
Subspace Designs based on Algebraic Function Fields. CoRR abs/1704.05992 (2017) - [i8]Venkatesan Guruswami, Chaoping Xing, Chen Yuan:
Subspace Designs based on Algebraic Function Fields. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [c2]Liyu Zhang, Chen Yuan, Haibin Kan:
Probabilistic Autoreductions. SOFSEM 2016: 418-429 - [i7]Ronald Cramer, Chaoping Xing, Chen Yuan:
On Multi-Point Local Decoding of Reed-Muller Codes. CoRR abs/1604.01925 (2016) - [i6]Ronald Cramer, Chaoping Xing, Chen Yuan:
On Multi-Point Local Decoding of Reed-Muller Codes. Electron. Colloquium Comput. Complex. TR16 (2016) - [i5]Ronald Cramer, Chaoping Xing, Chen Yuan:
On Multi-Point Local Decoding of Reed-Muller Codes. IACR Cryptol. ePrint Arch. 2016: 369 (2016) - 2015
- [j12]Chen Yuan
A refined analysis on the jump number problem of interval orders. Inf. Process. Lett. 115(11): 797-800 (2015) - [j11]Tian-Ming Bu, Chen Yuan
Computing on binary strings. Theor. Comput. Sci. 562: 122-128 (2015) - [j10]Chen Yuan
Revisiting a randomized algorithm for the minimum rainbow subgraph problem. Theor. Comput. Sci. 593: 154-159 (2015) - [i4]Chaoping Xing, Chen Yuan:
A new class of rank-metric codes and their list decoding beyond the unique decoding radius. CoRR abs/1509.07337 (2015) - [i3]Keqin Feng, Lingfei Jin, Chaoping Xing, Chen Yuan:
Multipartite entangled states, symmetric matrices and error-correcting codes. CoRR abs/1511.07992 (2015) - [i2]Chaoping Xing, Chen Yuan:
A new class of rank-metric codes and their list decoding beyond the unique decoding radius. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j9]Songtao Liang, Chen Yuan
Linear Exact-Repair Construction of Hybrid MSR Codes in Distributed Storage Systems. IEEE Commun. Lett. 18(7): 1095-1098 (2014) - [j8]Chen Yuan
A note on sparse solutions of sparse linear systems. Theor. Comput. Sci. 552: 109-111 (2014) - 2013
- [j7]Yuan Li, Chen Yuan
Explicit-form complex orthogonal design for space-time block codes. Sci. China Inf. Sci. 56(6): 1-10 (2013) - 2012
- [j6]Chen Yuan
A characterization of solvability for a class of networks. Sci. China Inf. Sci. 55(4): 747-754 (2012) - [j5]Chen Yuan
A construction method of matroidal networks. Sci. China Inf. Sci. 55(11): 2445-2453 (2012) - [j4]Chen Yuan
Smaller Bound of Superconcentrator. IEICE Trans. Inf. Syst. 95-D(9): 2339-2342 (2012) - [j3]Chen Yuan
A novel elementary construction of matching vectors. Inf. Process. Lett. 112(12): 494-496 (2012) - [c1]Yuan Li, Chen Yuan
Novel constructions of complex orthogonal designs for space-time block codes. INFOCOM 2012: 2167-2173 - 2011
- [j2]Chen Yuan
Holographic reduction for some counting problems. Inf. Process. Lett. 111(15): 761-766 (2011) - [i1]Tian-Ming Bu, Chen Yuan, Peng Zhang:
Computing on Binary Strings. CoRR abs/1112.0278 (2011) - 2010
- [j1]Yuan Li, Haibin Kan, Chen Yuan
The maximal rates and minimal decoding delay of more general complex orthogonal designs. Sci. China Inf. Sci. 53(9): 1826-1832 (2010)
Coauthor Index
[j29] [j28] [i35] [j25] [j24] [c21] [c20] [c19] [c17] [i34] [i32] [i31] [i30] [i29] [j23] [c15] [i27] [i25] [c13] [i23] [j22] [j21] [c12] [c11] [i22] [j20] [j19] [j18] [c8] [i21] [i20] [i17] [j17] [j16] [c6] [c5] [i15] [i14] [i13] [i12] [i11] [i10] [j14] [j13] [c4] [c3] [i9] [i8] [i7] [i6] [i5] [i4] [i3] [i2]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: