Chen Yuan

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 68

Top Topics

Sparse Linear Systems

Frequency Hopping

Top Venues

IACR Cryptol. ePrint Arch.

IEEE Trans. Inf. Theory

Publications

Zeyu Guo, Chaoping Xing, Chen Yuan, Zihan Zhang
Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric. CoRR (2024)
Nicolas Resch, Chen Yuan
Threshold Rates of Code Ensembles: Linear Is Best. IEEE Trans. Inf. Theory 70 (7) (2024)
Shu Liu, Ting-Yi Wu, Chaoping Xing, Chen Yuan
On Lengths of Singleton-Optimal Locally Repairable Codes. IEEE Trans. Commun. 72 (1) (2024)
Jonathan Mosheiff, Nicolas Resch, Kuo Shang, Chen Yuan
Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes. CoRR (2024)
Chaoping Xing, Chen Yuan
Evolving Secret Sharing Schemes Based on Polynomial Evaluations and Algebraic Geometry Codes. IEEE Trans. Inf. Theory 70 (5) (2024)
Shu Liu, Chaoping Xing, Chen Yuan
List Decoding of Rank-Metric Codes with Row-To-Column Ratio Bigger Than 1/2. ICALP (2023)
Chaoping Xing, Chen Yuan
Beating the Probabilistic Lower Bound on q-Perfect Hashing. Comb. 43 (2) (2023)
Hongqing Liu, Chaoping Xing, Chen Yuan, Taoxu Zou
Dishonest Majority Multiparty Computation over Matrix Rings. IACR Cryptol. ePrint Arch. 2023 (2023)
Nicolas Resch, Chen Yuan
Two-Round Perfectly Secure Message Transmission with Optimal Transmission Rate. ITC (2023)
Nicolas Resch, Chen Yuan, Yihan Zhang
Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery. ICALP (2023)
Hongqing Liu, Chaoping Xing, Yanjiang Yang, Chen Yuan
Ramp hyper-invertible matrices and their applications to MPC protocols. IACR Cryptol. ePrint Arch. 2023 (2023)
Daniel Escudero, Hongqing Liu, Chaoping Xing, Chen Yuan
Degree-D Reverse Multiplication-Friendly Embeddings: Constructions and Applications. IACR Cryptol. ePrint Arch. 2023 (2023)
Keqin Feng, Lingfei Jin, Chaoping Xing, Chen Yuan
Constructions of k-Uniform States in Heterogeneous Systems. IEEE Trans. Inf. Theory 69 (9) (2023)
Hongqing Liu, Chaoping Xing, Yanjiang Yang, Chen Yuan
Ramp Hyper-invertible Matrices and Their Applications to MPC Protocols. ASIACRYPT (1) (2023)
Nicolas Resch, Chen Yuan, Yihan Zhang
Tight Bounds on List-Decodable and List-Recoverable Zero-Rate Codes. CoRR (2023)
Fuchun Lin, Chaoping Xing, Yizhou Yao, Chen Yuan
Amortized NISC over $\mathbb {Z}_{2^k}$ from RMFE. ASIACRYPT (1) (2023)
Keqin Feng, Lingfei Jin, Chaoping Xing, Chen Yuan
Constructions of k-uniform states in heterogeneous systems. CoRR (2023)
Fuchun Lin, Chaoping Xing, Yizhou Yao, Chen Yuan
from RMFE. IACR Cryptol. ePrint Arch. 2023 (2023)
Daniel Escudero, Cheng Hong, Hongqing Liu, Chaoping Xing, Chen Yuan
Degree-D Reverse Multiplication-Friendly Embeddings: Constructions and Applications. ASIACRYPT (1) (2023)
Shu Liu, Tingyi Wu, Chaoping Xing, Chen Yuan
Upper bounds on maximum lengths of Singleton-optimal locally repairable codes. CoRR (2022)
Daniel Escudero, Chaoping Xing, Chen Yuan
via Galois Rings. IACR Cryptol. ePrint Arch. 2022 (2022)
Nicolas Resch, Chen Yuan, Yihan Zhang
Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery. CoRR (2022)
Chaoping Xing, Chen Yuan
Construction of Optimal (r, δ)-Locally Recoverable Codes and Connection With Graph Theory. IEEE Trans. Inf. Theory 68 (7) (2022)
Nicolas Resch, Chen Yuan
Threshold Rates of Codes Ensembles: Linear is Best. CoRR (2022)
Daniel Escudero, Chaoping Xing, Chen Yuan
More Efficient Dishonest Majority Secure Computation over $\mathbb {Z}_{2^k}$ via Galois Rings. CRYPTO (1) (2022)
Nicolas Resch, Chen Yuan
Threshold Rates of Code Ensembles: Linear Is Best. ICALP (2022)
Chaoping Xing, Chen Yuan
Beating the probabilistic lower bound on perfect hashing. SODA (2021)
Nicolas Resch, Chen Yuan
Two-Round Perfectly Secure Message Transmission with Optimal Transmission Rate. IACR Cryptol. ePrint Arch. 2021 (2021)
Chaoping Xing, Chen Yuan
Evolving Secret Sharing Schemes Based on Polynomial Evaluations and Algebraic Geometry Codes. IACR Cryptol. ePrint Arch. 2021 (2021)
Ronald Cramer, Chaoping Xing, Chen Yuan
On the Complexity of Arithmetic Secret Sharing. TCC (3) (2020)
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)
Serge Fehr, Chen Yuan
Robust Secret Sharing with Almost Optimal Share Size and Security Against Rushing Adversaries. TCC (3) (2020)
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 (2020)
Ronald Cramer, Chaoping Xing, Chen Yuan
Efficient Multi-Point Local Decoding of Reed-Muller Codes via Interleaved Codex. IEEE Trans. Inf. Theory 66 (1) (2020)
Xianhua Niu, Chaoping Xing, Chen Yuan
Asymptotic Gilbert-Varshamov Bound on Frequency Hopping Sequences. IEEE Trans. Inf. Theory 66 (2) (2020)
Yuan Luo, Chaoping Xing, Chen Yuan
Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes. IEEE Trans. Inf. Theory 65 (2) (2019)
Venkatesan Guruswami, Chaoping Xing, Chen Yuan
How Long Can Optimal Locally Repairable Codes Be? IEEE Trans. Inf. Theory 65 (6) (2019)
Serge Fehr, Chen Yuan
Towards optimal robust secret sharing with security against a rushing adversary. IACR Cryptol. ePrint Arch. 2019 (2019)
Chaoping Xing, Chen Yuan
Beating the probabilistic lower bound on perfect hashing. Electron. Colloquium Comput. Complex. 26 (2019)
Mark Abspoel, Ronald Cramer, Ivan Damgård, Daniel Escudero, Chen Yuan
Z via Galois Rings. TCC (1) (2019)
Mark Abspoel, Ronald Cramer, Ivan Damgård, Daniel Escudero, Chen Yuan
ℤ via Galois Rings. IACR Cryptol. ePrint Arch. 2019 (2019)
Chaoping Xing, Chen Yuan
Beating the probabilistic lower bound on perfect hashing. CoRR (2019)
Serge Fehr, Chen Yuan
Towards Optimal Robust Secret Sharing with Security Against a Rushing Adversary. EUROCRYPT (3) (2019)
Chaoping Xing, Chen Yuan
Construction of Optimal Locally Recoverable Codes and Connection with Hypergraph. ICALP (2019)
Ronald Cramer, Chaoping Xing, Chen Yuan
On the Complexity of Arithmetic Secret Sharing. IACR Cryptol. ePrint Arch. 2019 (2019)
Serge Fehr, Chen Yuan
Robust Secret Sharing with Optimal Share Size and Security Against Rushing Adversaries. IACR Cryptol. ePrint Arch. 2019 (2019)
Shu Liu, Chaoping Xing, Chen Yuan
List Decodability of Symbol-Pair Codes. IEEE Trans. Inf. Theory 65 (8) (2019)
Venkatesan Guruswami, Chaoping Xing, Chen Yuan
How Long Can Optimal Locally Repairable Codes Be?. APPROX-RANDOM (2018)
Venkatesan Guruswami, Chaoping Xing, Chen Yuan
How long can optimal locally repairable codes be? CoRR (2018)
Ignacio Cascudo, Ronald Cramer, Chaoping Xing, Chen Yuan
Amortized Complexity of Information-Theoretically Secure MPC Revisited. IACR Cryptol. ePrint Arch. 2018 (2018)
Xianhua Niu, Chaoping Xing, Chen Yuan
Asymptotic Gilbert-Varshamov bound on Frequency Hopping. CoRR (2018)
Shu Liu, Chaoping Xing, Chen Yuan
List Decoding of Cover Metric Codes Up to the Singleton Bound. IEEE Trans. Inf. Theory 64 (4) (2018)
Chaoping Xing, Chen Yuan
Construction of optimal locally recoverable codes and connection with hypergraph. CoRR (2018)
Chaoping Xing, Chen Yuan
A New Class of Rank-Metric Codes and Their List Decoding Beyond the Unique Decoding Radius. IEEE Trans. Inf. Theory 64 (5) (2018)
Yuan Luo, Chaoping Xing, Chen Yuan
Optimal locally repairable codes of distance 3 and 4 via cyclic codes. CoRR (2018)
Shu Liu, Chaoping Xing, Chen Yuan
List Decodability of Symbol-Pair Codes. CoRR (2018)
Ignacio Cascudo, Ronald Cramer, Chaoping Xing, Chen Yuan
Amortized Complexity of Information-Theoretically Secure MPC Revisited. CRYPTO (3) (2018)
Venkatesan Guruswami, Chaoping Xing, Chen Yuan
Subspace Designs Based on Algebraic Function Fields. ICALP (2017)
Venkatesan Guruswami, Chaoping Xing, Chen Yuan
Subspace Designs based on Algebraic Function Fields. CoRR (2017)
Ronald Cramer, Ivan Damgård, Chaoping Xing, Chen Yuan
Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack. EUROCRYPT (1) (2017)
Keqin Feng, Lingfei Jin, Chaoping Xing, Chen Yuan
Multipartite Entangled States, Symmetric Matrices, and Error-Correcting Codes. IEEE Trans. Inf. Theory 63 (9) (2017)
Venkatesan Guruswami, Chaoping Xing, Chen Yuan
Subspace Designs based on Algebraic Function Fields. Electron. Colloquium Comput. Complex. 24 (2017)
Ya-Li Liu, Chen Yuan
Linear Tail-Biting Trellis and Its Sectionalization. J. Inf. Sci. Eng. 33 (2) (2017)
Shu Liu, Chaoping Xing, Chen Yuan
List Decodability of Random Subcodes of Gabidulin Codes. IEEE Trans. Inf. Theory 63 (1) (2017)
Ronald Cramer, Chaoping Xing, Chen Yuan
On Multi-Point Local Decoding of Reed-Muller Codes. Electron. Colloquium Comput. Complex. 23 (2016)
Ronald Cramer, Chaoping Xing, Chen Yuan
On Multi-Point Local Decoding of Reed-Muller Codes. CoRR (2016)
Ronald Cramer, Chaoping Xing, Chen Yuan
On Multi-Point Local Decoding of Reed-Muller Codes. IACR Cryptol. ePrint Arch. 2016 (2016)
Liyu Zhang, Chen Yuan, Haibin Kan
Probabilistic Autoreductions. SOFSEM (2016)
Chaoping Xing, Chen Yuan
A new class of rank-metric codes and their list decoding beyond the unique decoding radius. Electron. Colloquium Comput. Complex. 22 (2015)
Keqin Feng, Lingfei Jin, Chaoping Xing, Chen Yuan
Multipartite entangled states, symmetric matrices and error-correcting codes. CoRR (2015)
Tian-Ming Bu, Chen Yuan, Peng Zhang
Computing on binary strings. Theor. Comput. Sci. 562 (2015)
Chen Yuan, Haibin Kan
Revisiting a randomized algorithm for the minimum rainbow subgraph problem. Theor. Comput. Sci. 593 (2015)
Chen Yuan, Haibin Kan
A refined analysis on the jump number problem of interval orders. Inf. Process. Lett. 115 (11) (2015)
Chaoping Xing, Chen Yuan
A new class of rank-metric codes and their list decoding beyond the unique decoding radius. CoRR (2015)
Chen Yuan, Haibin Kan
A note on sparse solutions of sparse linear systems. Theor. Comput. Sci. 552 (2014)
Songtao Liang, Chen Yuan, Haibin Kan
Linear Exact-Repair Construction of Hybrid MSR Codes in Distributed Storage Systems. IEEE Commun. Lett. 18 (7) (2014)
Yuan Li, Chen Yuan, Haibin Kan
Explicit-form complex orthogonal design for space-time block codes. Sci. China Inf. Sci. 56 (6) (2013)
Chen Yuan, Haibin Kan
A characterization of solvability for a class of networks. Sci. China Inf. Sci. 55 (4) (2012)
Chen Yuan, Qian Guo, Haibin Kan
A novel elementary construction of matching vectors. Inf. Process. Lett. 112 (12) (2012)
Yuan Li, Chen Yuan, Haibin Kan
Novel constructions of complex orthogonal designs for space-time block codes. INFOCOM (2012)
Chen Yuan, Haibin Kan, Xin Wang, Hideki Imai
A construction method of matroidal networks. Sci. China Inf. Sci. 55 (11) (2012)
Chen Yuan, Haibin Kan
Smaller Bound of Superconcentrator. IEICE Trans. Inf. Syst. (9) (2012)
Tian-Ming Bu, Chen Yuan, Peng Zhang
Computing on Binary Strings CoRR (2011)
Chen Yuan, Haibin Kan
Holographic reduction for some counting problems. Inf. Process. Lett. 111 (15) (2011)
Yuan Li, Haibin Kan, Chen Yuan, Huanfei Ma
The maximal rates and minimal decoding delay of more general complex orthogonal designs. Sci. China Inf. Sci. 53 (9) (2010)