default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChaoping Xing
Person information
- affiliation: Nanyang Technological University, Singapore
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j125]Shu Liu
, Ting-Yi Wu, Chaoping Xing, Chen Yuan:
On Lengths of Singleton-Optimal Locally Repairable Codes. IEEE Trans. Commun. 72(1): 3-12 (2024)- [j124]Xubin Hu, Lingfei Jin, Liming Ma, Chaoping Xing:
Binary Sequences With a Low Correlation via Cyclotomic Function Fields of Odd Characteristic. IEEE Trans. Inf. Theory 70(2): 1397-1407 (2024) - [j123]Chaoping Xing, Chen Yuan:
Evolving Secret Sharing Schemes Based on Polynomial Evaluations and Algebraic Geometry Codes. IEEE Trans. Inf. Theory 70(5): 3718-3728 (2024) - [j122]Shu Liu, Ivan Tjuawinata, Chaoping Xing:
Explicit Construction of q-Ary 2-Deletion Correcting Codes With Low Redundancy. IEEE Trans. Inf. Theory 70(6): 4093-4101 (2024) - [c49]Fuchun Lin, Chaoping Xing, Yizhou Yao:
More Efficient Zero-Knowledge Protocols over $\mathbb {Z}_{2^k}$ via Galois Rings. CRYPTO (9) 2024: 424-457 - [c48]Shu Liu, Yunqi Wan, Chaoping Xing:
Repairing Reed-Solomon Codes with Less Bandwidth. ISIT 2024: 494-498 - [c47]Shu Liu, Chaoping Xing:
Nonlinear Codes with Low Redundancy. ISIT 2024: 705-710 - [c46]Songsong Li, Shu Liu, Liming Ma, Yunqi Wan, Chaoping Xing:
Asymptotic Construction of Locally Repairable Codes with Multiple Recovering Sets. ISIT 2024: 2820-2825 - [c45]Daniel Escudero, Ivan Tjuawinata, Chaoping Xing:
On Information-Theoretic Secure Multiparty Computation with Local Repairability. Public Key Cryptography (2) 2024: 205-239 - [c44]Songsong Li, Chaoping Xing:
Fast Fourier transform via automorphism groups of rational function fields. SODA 2024: 3836-3859 - [i105]Singsong Li, Shu Liu, Liming Ma, Chaoping Xing:
Asymptotic construction of locally repairable codes with multiple recovering sets. CoRR abs/2402.09898 (2024) - [i104]Zeyu Guo, Chaoping Xing, Chen Yuan, Zihan Zhang:
Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric. CoRR abs/2404.13230 (2024) - [i103]Songsong Li, Shu Liu, Liming Ma, Yunqi Wan, Chaoping Xing:
Encoding of algebraic geometry codes with quasi-linear complexity O(N log N). CoRR abs/2407.04618 (2024) - [i102]Lingfei Jin, Liming Ma, Chaoping Xing, Runtian Zhu:
A new family of binary sequences with a low correlation via elliptic curves. CoRR abs/2407.18570 (2024) - [i101]Jiang Li, Songsong Li, Chaoping Xing:
Algebraic Geometry Codes for Distributed Matrix Multiplication Using Local Expansions. CoRR abs/2408.01806 (2024) - [i100]Daniel Escudero, Ivan Tjuawinata, Chaoping Xing:
On Information-Theoretic Secure Multiparty Computation with Local Repairability. IACR Cryptol. ePrint Arch. 2024: 391 (2024) - [i99]Fuchun Lin, Chaoping Xing, Yizhou Yao:
Interactive Line-Point Zero-Knowledge with Sublinear Communication and Linear Computation. IACR Cryptol. ePrint Arch. 2024: 1431 (2024) - 2023
- [j121]Chaoping Xing, Chen Yuan:
Beating the Probabilistic Lower Bound on q-Perfect Hashing. Comb. 43(2): 347-366 (2023) - [j120]Liming Ma, Chaoping Xing:
The group structures of automorphism groups of elliptic curves over finite fields and their applications to optimal locally repairable codes. J. Comb. Theory A 193: 105686 (2023) - [j119]Jin Yi Chen, Shu Liu, Liming Ma, Ting-Yi Wu, Chaoping Xing:
Optimal and Asymptotically Good Locally Repairable Codes via Propagation Rules. IEEE Trans. Commun. 71(10): 5623-5632 (2023) - [j118]Shu Liu, Chaoping Xing:
Bounds and Constructions for Insertion and Deletion Codes. IEEE Trans. Inf. Theory 69(2): 928-940 (2023) - [j117]Shu Liu, Chaoping Xing:
Maximally Recoverable Local Repairable Codes From Subspace Direct Sum Systems. IEEE Trans. Inf. Theory 69(4): 2300-2310 (2023) - [j116]Shu Liu, Liming Ma, Ting-Yi Wu, Chaoping Xing:
A New Construction of Nonlinear Codes via Algebraic Function Fields. IEEE Trans. Inf. Theory 69(9): 5640-5647 (2023) - [j115]Keqin Feng, Lingfei Jin, Chaoping Xing, Chen Yuan:
Constructions of k-Uniform States in Heterogeneous Systems. IEEE Trans. Inf. Theory 69(9): 5845-5856 (2023) - [j114]Shu Liu, Ivan Tjuawinata, Chaoping Xing:
A Lower Bound on the List-Decodability of Insdel Codes. IEEE Trans. Inf. Theory 69(11): 6989-7002 (2023) - [c43]Fuchun Lin, Chaoping Xing, Yizhou Yao, Chen Yuan:
Amortized NISC over $\mathbb {Z}_{2^k}$ from RMFE. ASIACRYPT (1) 2023: 38-70 - [c42]Daniel Escudero, Cheng Hong, Hongqing Liu, Chaoping Xing, Chen Yuan:
Degree-D Reverse Multiplication-Friendly Embeddings: Constructions and Applications. ASIACRYPT (1) 2023: 106-138 - [c41]Hongqing Liu, Chaoping Xing, Yanjiang Yang, Chen Yuan:
Ramp Hyper-invertible Matrices and Their Applications to MPC Protocols. ASIACRYPT (1) 2023: 204-236 - [c40]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 - [c39]Shu Liu, Tingyi Wu, Chaoping Xing:
Nonlinear codes exceeding the Gilbert-Varshamov and Tsfasman-Vlăduţ-Zink bounds. SODA 2023: 4104-4114 - [i98]Keqin Feng, Lingfei Jin, Chaoping Xing, Chen Yuan:
Constructions of k-uniform states in heterogeneous systems. CoRR abs/2305.12769 (2023) - [i97]Shu Liu, Ivan Tjuawinata, Chaoping Xing:
Explicit Construction of q-ary 2-deletion Correcting Codes with Low Redundancy. CoRR abs/2306.02868 (2023) - [i96]Shu Liu, Chaoping Xing, Yaqian Zhang:
Codes with Biochemical Constraints and Single Error Correction for DNA-Based Data Storage. CoRR abs/2307.00221 (2023) - [i95]Shu Liu, Chaoping Xing:
Nonlinear Codes with Low Redundancy. CoRR abs/2310.14219 (2023) - [i94]Songsong Li, Chaoping Xing:
Fast Fourier transform via automorphism groups of rational function fields. CoRR abs/2310.14462 (2023) - [i93]Fuchun Lin, Chaoping Xing, Yizhou Yao:
More Efficient Zero-Knowledge Protocols over ℤ2k via Galois Rings. IACR Cryptol. ePrint Arch. 2023: 150 (2023) - [i92]Daniel Escudero, Hongqing Liu, Chaoping Xing, Chen Yuan:
Degree-D Reverse Multiplication-Friendly Embeddings: Constructions and Applications. IACR Cryptol. ePrint Arch. 2023: 173 (2023) - [i91]Fuchun Lin, Chaoping Xing, Yizhou Yao, Chen Yuan:
Amortized NISC over ℤ2k from RMFE. IACR Cryptol. ePrint Arch. 2023: 1363 (2023) - [i90]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) - [i89]Hongqing Liu, Chaoping Xing, Chen Yuan, Taoxu Zou:
Dishonest Majority Multiparty Computation over Matrix Rings. IACR Cryptol. ePrint Arch. 2023: 1912 (2023) - 2022
- [j113]Shaoquan Jiang, Yeow Meng Chee, San Ling, Huaxiong Wang, Chaoping Xing:
A new framework for deniable secure key exchange. Inf. Comput. 285(Part): 104866 (2022) - [j112]Venkatesan Guruswami, Chaoping Xing:
Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes. J. ACM 69(2): 10:1-10:48 (2022) - [j111]Jian Ding, Changlu Lin, Huaxiong Wang, Chaoping Xing:
Communication Efficient Secret Sharing With Small Share Size. IEEE Trans. Inf. Theory 68(1): 659-669 (2022) - [j110]Lingfei Jin, Liming Ma, Chaoping Xing:
Binary Sequences With a Low Correlation via Cyclotomic Function Fields. IEEE Trans. Inf. Theory 68(5): 3445-3454 (2022) - [j109]Chaoping Xing, Chen Yuan:
Construction of Optimal (r, δ)-Locally Recoverable Codes and Connection With Graph Theory. IEEE Trans. Inf. Theory 68(7): 4320-4328 (2022) - [j108]Ivan Tjuawinata, Chaoping Xing:
Leakage-Resilient Secret Sharing With Constant Share Size. IEEE Trans. Inf. Theory 68(12): 8228-8250 (2022) - [c38]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 - [i88]Shu Liu, Tingyi Wu, Chaoping Xing, Chen Yuan:
Upper bounds on maximum lengths of Singleton-optimal locally repairable codes. CoRR abs/2207.05417 (2022) - [i87]Shu Liu, Liming Ma, Tingyi Wu, Chaoping Xing:
Good locally repairable codes via propagation rules. CoRR abs/2208.04484 (2022) - [i86]Shu Liu, Liming Ma, Tingyi Wu, Chaoping Xing:
A new construction of nonlinear codes via algebraic function fields. CoRR abs/2208.14569 (2022) - [i85]Lingfei Jin, Liming Ma, Chaoping Xing:
Binary sequences with a low correlation via cyclotomic function fields with odd characteristics. CoRR abs/2210.12647 (2022) - [i84]Shu Liu, Ivan Tjuawinata, Chaoping Xing:
A Lower Bound on the List-Decodability of Insdel Codes. CoRR abs/2211.06606 (2022) - [i83]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
- [j107]Venkatesan Guruswami, Nicolas Resch, Chaoping Xing:
Lossless Dimension Expanders Via Linearized Polynomials and Subspace Designs. Comb. 41(4): 545-579 (2021) - [j106]Peiyi Wang, Lin You, Gengran Hu, Liqin Hu, Zhihua Jian, Chaoping Xing:
Biometric key generation based on generated intervals and two-layer error correcting technique. Pattern Recognit. 111: 107733 (2021) - [j105]Lingfei Jin, Liming Ma, Chaoping Xing:
A New Construction of Nonlinear Codes via Rational Function Fields. IEEE Trans. Inf. Theory 67(2): 770-777 (2021) - [j104]Tai Do Duc, Shu Liu, Ivan Tjuawinata, Chaoping Xing:
Explicit Constructions of Two-Dimensional Reed-Solomon Codes in High Insertion and Deletion Noise Regime. IEEE Trans. Inf. Theory 67(5): 2808-2820 (2021) - [j103]Shu Liu, Ivan Tjuawinata, Chaoping Xing:
Efficiently List-Decodable Insertion and Deletion Codes via Concatenation. IEEE Trans. Inf. Theory 67(9): 5778-5790 (2021) - [c37]Mark Abspoel, Ronald Cramer, Daniel Escudero, Ivan Damgård, Chaoping Xing:
Improved Single-Round Secure Multiplication Using Regenerating Codes. ASIACRYPT (2) 2021: 222-244 - [c36]Ronald Cramer, Matthieu Rambaud, Chaoping Xing:
Asymptotically-Good Arithmetic Secret Sharing over $\mathbb {Z}/p^{\ell }\mathbb {Z}$ with Strong Multiplication and Its Applications to Efficient MPC. CRYPTO (3) 2021: 656-686 - [c35]Chaoping Xing, Chen Yuan:
Beating the probabilistic lower bound on perfect hashing. SODA 2021: 33-41 - [i82]Chaoping Xing, Zihan Zhang:
A New Metric on Symmetric Group and Application to Block Permutation Codes. CoRR abs/2103.05204 (2021) - [i81]Ivan Tjuawinata, Chaoping Xing:
Leakage-Resilient Secret Sharing with Constant Share Size. CoRR abs/2105.03074 (2021) - [i80]Lingfei Jin, Liming Ma, Chaoping Xing:
Binary sequences with low correlation via cyclotomic function fields. CoRR abs/2107.11766 (2021) - [i79]Shu Liu, Chaoping Xing:
Maximally recoverable local reconstruction codes from subspace direct sum systems. CoRR abs/2111.03244 (2021) - [i78]Shu Liu, Chaoping Xing:
Bounds and Constructions for Insertion and Deletion Codes. CoRR abs/2111.14026 (2021) - [i77]Mark Abspoel, Ronald Cramer, Daniel Escudero, Ivan Damgård, Chaoping Xing:
Improved single-round secure multiplication using regenerating codes. IACR Cryptol. ePrint Arch. 2021: 253 (2021) - [i76]Chaoping Xing, Chen Yuan:
Evolving Secret Sharing Schemes Based on Polynomial Evaluations and Algebraic Geometry Codes. IACR Cryptol. ePrint Arch. 2021: 1115 (2021) - 2020
- [j102]Yang Liu, Yan Kang, Chaoping Xing, Tianjian Chen, Qiang Yang:
A Secure Federated Transfer Learning Framework. IEEE Intell. Syst. 35(4): 70-82 (2020) - [j101]Lingfei Jin, Liming Ma, Chaoping Xing:
Construction of Optimal Locally Repairable Codes via Automorphism Groups of Rational Function Fields. IEEE Trans. Inf. Theory 66(1): 210-221 (2020) - [j100]Ronald Cramer, Chaoping Xing, Chen Yuan:
Efficient Multi-Point Local Decoding of Reed-Muller Codes via Interleaved Codex. IEEE Trans. Inf. Theory 66(1): 263-272 (2020) - [j99]Xianhua Niu, Chaoping Xing, Chen Yuan:
Asymptotic Gilbert-Varshamov Bound on Frequency Hopping Sequences. IEEE Trans. Inf. Theory 66(2): 1213-1218 (2020) - [j98]Zhe Li, San Ling, Chaoping Xing, Sze Ling Yeo:
On the Bounded Distance Decoding Problem for Lattices Constructed and Their Cryptographic Applications. IEEE Trans. Inf. Theory 66(4): 2588-2598 (2020) - [j97]Xianhua Niu, Chaoping Xing, Yang Liu, Liang Zhou:
A Construction of Optimal Frequency Hopping Sequence Set via Combination of Multiplicative and Additive Groups of Finite Fields. IEEE Trans. Inf. Theory 66(8): 5310-5315 (2020) - [j96]Liming Ma, Chaoping Xing:
Constructive Asymptotic Bounds of Locally Repairable Codes via Function Fields. IEEE Trans. Inf. Theory 66(9): 5395-5403 (2020) - [j95]Venkatesan Guruswami, Lingfei Jin, Chaoping Xing:
Constructions of Maximally Recoverable Local Reconstruction Codes via Function Fields. IEEE Trans. Inf. Theory 66(10): 6133-6143 (2020) - [c34]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 - [c33]Ronald Cramer, Chaoping Xing:
Blackbox Secret Sharing Revisited: A Coding-Theoretic Approach with Application to Expansionless Near-Threshold Schemes. EUROCRYPT (1) 2020: 499-528 - [c32]Ronald Cramer, Chaoping Xing, Chen Yuan:
On the Complexity of Arithmetic Secret Sharing. TCC (3) 2020: 444-469 - [i75]Tai Do Duc, Shuo Shao, Chaoping Xing:
Symmetric uncoded caching schemes with low subpacketization levels. CoRR abs/2002.11383 (2020) - [i74]Ziyao Liu, Ivan Tjuawinata, Chaoping Xing, Kwok-Yan Lam:
MPC-enabled Privacy-Preserving Neural Network Training against Malicious Attack. CoRR abs/2007.12557 (2020) - [i73]Liming Ma, Chaoping Xing:
The group structures of automorphism groups of elliptic function fields over finite fields and their applications to optimal locally repairable codes. CoRR abs/2008.12119 (2020) - [i72]Jiale Guo, Ziyao Liu, Kwok-Yan Lam, Jun Zhao, Yiqiang Chen, Chaoping Xing:
Secure Weighted Aggregation in Federated Learning. CoRR abs/2010.08730 (2020) - [i71]Venkatesan Guruswami, Chaoping Xing:
Optimal rate list decoding over bounded alphabets using algebraic-geometric codes. Electron. Colloquium Comput. Complex. TR20 (2020) - [i70]Zhe Li, Chaoping Xing, Sze Ling Yeo:
A New Code Based Signature Scheme without Trapdoors. IACR Cryptol. ePrint Arch. 2020: 1250 (2020) - [i69]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
- [j94]Xudong Li, Liming Ma, Chaoping Xing:
Optimal Locally Repairable Codes Via Elliptic Curves. IEEE Trans. Inf. Theory 65(1): 108-117 (2019) - [j93]Yuan Luo, Chaoping Xing, Chen Yuan:
Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes. IEEE Trans. Inf. Theory 65(2): 1048-1053 (2019) - [j92]Venkatesan Guruswami, Chaoping Xing, Chen Yuan:
How Long Can Optimal Locally Repairable Codes Be? IEEE Trans. Inf. Theory 65(6): 3662-3670 (2019) - [j91]Shu Liu, Chaoping Xing, Chen Yuan:
List Decodability of Symbol-Pair Codes. IEEE Trans. Inf. Theory 65(8): 4815-4821 (2019) - [j90]Xianhua Niu, Chaoping Xing:
New Extension Constructions of Optimal Frequency-Hopping Sequence Sets. IEEE Trans. Inf. Theory 65(9): 5846-5855 (2019) - [j89]Xudong Li, Liming Ma, Chaoping Xing:
Construction of Asymptotically Good Locally Repairable Codes via Automorphism Groups of Function Fields. IEEE Trans. Inf. Theory 65(11): 7087-7094 (2019) - [c31]Shreya Sharma, Chaoping Xing, Yang Liu, Yan Kang:
Secure and Efficient Federated Transfer Learning. IEEE BigData 2019: 2569-2576 - [c30]Venkatesan Guruswami, Lingfei Jin, Chaoping Xing:
Constructions of Maximally Recoverable Local Reconstruction Codes via Function Fields. ICALP 2019: 68:1-68:14 - [c29]Chaoping Xing, Chen Yuan:
Construction of Optimal Locally Recoverable Codes and Connection with Hypergraph. ICALP 2019: 98:1-98:13 - [c28]Zhe Li, Chaoping Xing, Sze Ling Yeo:
Reducing the Key Size of McEliece Cryptosystem from Automorphism-induced Goppa Codes via Permutations. Public Key Cryptography (2) 2019: 599-617 - [i68]Shu Liu, Ivan Tjuawinata, Chaoping Xing:
On List Decoding of Insertion and Deletion Errors. CoRR abs/1906.09705 (2019) - [i67]Liming Ma, Chaoping Xing:
Constructive asymptotic bounds of locally repairable codes via function fields. CoRR abs/1908.01471 (2019) - [i66]Chaoping Xing, Chen Yuan:
Beating the probabilistic lower bound on perfect hashing. CoRR abs/1908.08792 (2019) - [i65]Shu Liu, Ivan Tjuawinata, Chaoping Xing:
Explicit Constructions of Two-Dimensional Reed-Solomon Codes in High Insertion and Deletion Noise Regime. CoRR abs/1909.03426 (2019) - [i64]Shreya Sharma, Chaoping Xing, Yang Liu, Yan Kang:
Secure and Efficient Federated Transfer Learning. CoRR abs/1910.13271 (2019) - [i63]Lingfei Jin, Gaojun Luo, Chaoping Xing:
Optimal repairing schemes for Reed-Solomon codes with alphabet sizes linear in lengths under the rack-aware model. CoRR abs/1911.08016 (2019) - [i62]Lingfei Jin, Liming Ma, Chaoping Xing:
A new construction of nonlinear codes via rational function fields. CoRR abs/1912.09830 (2019) - [i61]Chaoping Xing, Chen Yuan:
Beating the probabilistic lower bound on perfect hashing. Electron. Colloquium Comput. Complex. TR19 (2019) - [i60]Ronald Cramer, Matthieu Rambaud, Chaoping Xing:
Asymptotically-Good Arithmetic Secret Sharing over Z/(p^\ell Z) with Strong Multiplication and Its Applications to Efficient MPC. IACR Cryptol. ePrint Arch. 2019: 832 (2019) - [i59]Ronald Cramer, Chaoping Xing:
Blackbox Secret Sharing Revisited: A Coding-Theoretic Approach with Application to Expansionless Near-Threshold Schemes. IACR Cryptol. ePrint Arch. 2019: 1134 (2019) - [i58]Ronald Cramer, Chaoping Xing, Chen Yuan:
On the Complexity of Arithmetic Secret Sharing. IACR Cryptol. ePrint Arch. 2019: 1137 (2019) - [i57]Thomas Attema, Ronald Cramer, Chaoping Xing:
A note on short invertible ring elements and applications to cyclotomic and trinomials number fields. IACR Cryptol. ePrint Arch. 2019: 1200 (2019) - 2018
- [j88]Lingfei Jin, Yuan Luo, Chaoping Xing:
Repairing Algebraic Geometry Codes. IEEE Trans. Inf. Theory 64(2): 900-908 (2018) - [j87]Shu Liu, Chaoping Xing, Chen Yuan:
List Decoding of Cover Metric Codes Up to the Singleton Bound. IEEE Trans. Inf. Theory 64(4): 2410-2416 (2018) - [j86]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): 3394-3402 (2018) - [j85]Lingfei Jin, Chaoping Xing:
Algebraic Geometry Codes With Complementary Duals Exceed the Asymptotic Gilbert-Varshamov Bound. IEEE Trans. Inf. Theory 64(9): 6277-6282 (2018) - [c27]Venkatesan Guruswami, Chaoping Xing, Chen Yuan:
How Long Can Optimal Locally Repairable Codes Be?. APPROX-RANDOM 2018: 41:1-41:11 - [c26]Venkatesan Guruswami, Nicolas Resch, Chaoping Xing:
Lossless Dimension Expanders via Linearized Polynomials and Subspace Designs. CCC 2018: 4:1-4:16 - [c25]Ignacio Cascudo, Ronald Cramer, Chaoping Xing, Chen Yuan:
Amortized Complexity of Information-Theoretically Secure MPC Revisited. CRYPTO (3) 2018: 395-426 - [c24]Ronald Cramer, Ivan Damgård, Daniel Escudero, Peter Scholl, Chaoping Xing:
SPDℤ2k: Efficient MPC mod 2k for Dishonest Majority. CRYPTO (2) 2018: 769-798 - [i56]Yuan Luo, Chaoping Xing, Chen Yuan:
Optimal locally repairable codes of distance 3 and 4 via cyclic codes. CoRR abs/1801.03623 (2018) - [i55]Shu Liu, Chaoping Xing, Chen Yuan:
List Decodability of Symbol-Pair Codes. CoRR abs/1806.08992 (2018) - [i54]Xianhua Niu, Chaoping Xing:
New extension constructions of optimal frequency hopping sequence sets. CoRR abs/1806.09869 (2018) - [i53]Venkatesan Guruswami, Chaoping Xing, Chen Yuan:
How long can optimal locally repairable codes be? CoRR abs/1807.01064 (2018) - [i52]Venkatesan Guruswami, Lingfei Jin, Chaoping Xing:
Constructions of maximally recoverable local reconstruction codes via function fields. CoRR abs/1808.04539 (2018) - [i51]Xianhua Niu, Chaoping Xing, Chen Yuan:
Asymptotic Gilbert-Varshamov bound on Frequency Hopping. CoRR abs/1810.11757 (2018) - [i50]Chaoping Xing, Chen Yuan:
Construction of optimal locally recoverable codes and connection with hypergraph. CoRR abs/1811.09142 (2018) - [i49]Xianhua Niu, Chaoping Xing:
A Construction of Optimal Frequency Hopping Sequence Set via Combination of Multiplicative and Additive Groups of Finite Fields. CoRR abs/1812.08993 (2018) - [i48]Venkatesan Guruswami, Nicolas Resch, Chaoping Xing:
Lossless dimension expanders via linearized polynomials and subspace designs. Electron. Colloquium Comput. Complex. TR18 (2018) - [i47]Ignacio Cascudo, Ronald Cramer, Chaoping Xing, Chen Yuan:
Amortized Complexity of Information-Theoretically Secure MPC Revisited. IACR Cryptol. ePrint Arch. 2018: 429 (2018) - [i46]Ronald Cramer, Ivan Damgård, Daniel Escudero, Peter Scholl, Chaoping Xing:
SPDℤ2k: Efficient MPC mod 2k for Dishonest Majority. IACR Cryptol. ePrint Arch. 2018: 482 (2018) - [i45]Zhe Li, Chaoping Xing, Sze Ling Yeo:
Reducing the Key Size of McEliece Cryptosystem from Goppa Codes via Permutations. IACR Cryptol. ePrint Arch. 2018: 1029 (2018) - 2017
- [j84]Shu Liu, Chaoping Xing, Chen Yuan:
List Decodability of Random Subcodes of Gabidulin Codes. IEEE Trans. Inf. Theory 63(1): 159-163 (2017) - [j83]Lingfei Jin, Chaoping Xing:
New MDS Self-Dual Codes From Generalized Reed - Solomon Codes. IEEE Trans. Inf. Theory 63(3): 1434-1438 (2017) - [j82]Venkatesan Guruswami, Lingfei Jin, Chaoping Xing:
Efficiently List-Decodable Punctured Reed-Muller Codes. IEEE Trans. Inf. Theory 63(7): 4317-4324 (2017) - [j81]Keqin Feng, Lingfei Jin, Chaoping Xing, Chen Yuan:
Multipartite Entangled States, Symmetric Matrices, and Error-Correcting Codes. IEEE Trans. Inf. Theory 63(9): 5618-5627 (2017) - [j80]Yuan Luo, Chaoping Xing, Lin You:
Construction of Sequences With High Nonlinear Complexity From Function Fields. IEEE Trans. Inf. Theory 63(12): 7646-7650 (2017) - [c23]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 - [c22]Venkatesan Guruswami, Chaoping Xing, Chen Yuan:
Subspace Designs Based on Algebraic Function Fields. ICALP 2017: 86:1-86:10 - [c21]Ronald Cramer, Ivan Damgård, Nico Döttling, Irene Giacomelli, Chaoping Xing:
Linear-Time Non-Malleable Codes in the Bit-Wise Independent Tampering Model. ICITS 2017: 1-25 - [i44]Lingfei Jin, Chaoping Xing:
Algebraic geometry codes with complementary duals exceed the asymptotic Gilbert-Varshamov bound. CoRR abs/1703.01441 (2017) - [i43]Venkatesan Guruswami, Chaoping Xing, Chen Yuan:
Subspace Designs based on Algebraic Function Fields. CoRR abs/1704.05992 (2017) - [i42]Venkatesan Guruswami, Chaoping Xing:
Optimal rate list decoding over bounded alphabets using algebraic-geometric codes. CoRR abs/1708.01070 (2017) - [i41]Lingfei Jin, Yuan Luo, Chaoping Xing:
Efficiently repairing algebraic geometry codes. CoRR abs/1710.01874 (2017) - [i40]Zhe Li, San Ling, Chaoping Xing, Sze Ling Yeo:
On the Closest Vector Problem for Lattices Constructed from Polynomials and Their Cryptographic Applications. CoRR abs/1710.02265 (2017) - [i39]Lingfei Jin, Liming Ma, Chaoping Xing:
Construction of optimal locally repairable codes via automorphism groups of rational function fields. CoRR abs/1710.09638 (2017) - [i38]Xudong Li, Liming Ma, Chaoping Xing:
Construction of asymptotically good locally repairable codes via automorphism groups of function fields. CoRR abs/1711.07703 (2017) - [i37]Xudong Li, Liming Ma, Chaoping Xing:
Optimal locally repairable codes via elliptic curves. CoRR abs/1712.03744 (2017) - [i36]Venkatesan Guruswami, Chaoping Xing, Chen Yuan:
Subspace Designs based on Algebraic Function Fields. Electron. Colloquium Comput. Complex. TR17 (2017) - [i35]Zhe Li, San Ling, Chaoping Xing, Sze Ling Yeo:
On the Closest Vector Problem for Lattices Constructed from Polynomials and Their Cryptographic Applications. IACR Cryptol. ePrint Arch. 2017: 1002 (2017) - 2016
- [j79]Venkatesan Guruswami, Carol Wang, Chaoping Xing:
Explicit List-Decodable Rank-Metric and Subspace Codes via Subspace Designs. IEEE Trans. Inf. Theory 62(5): 2707-2718 (2016) - [i34]Lingfei Jin, Chaoping Xing:
New MDS Self-Dual Codes from Generalized Reed-Solomon Codes. CoRR abs/1601.04467 (2016) - [i33]Ronald Cramer, Chaoping Xing, Chen Yuan:
On Multi-Point Local Decoding of Reed-Muller Codes. CoRR abs/1604.01925 (2016) - [i32]Lingfei Jin, Chaoping Xing, Xiande Zhang:
On the List-Decodability of Random Self-Orthogonal Codes. CoRR abs/1611.06673 (2016) - [i31]Ronald Cramer, Chaoping Xing, Chen Yuan:
On Multi-Point Local Decoding of Reed-Muller Codes. Electron. Colloquium Comput. Complex. TR16 (2016) - [i30]Ronald Cramer, Chaoping Xing, Chen Yuan:
On Multi-Point Local Decoding of Reed-Muller Codes. IACR Cryptol. ePrint Arch. 2016: 369 (2016) - [i29]Ronald Cramer, Ivan Damgård, Nico Döttling, Irene Giacomelli, Chaoping Xing:
Linear-Time Non-Malleable Codes in the Bit-Wise Independent Tampering Model. IACR Cryptol. ePrint Arch. 2016: 397 (2016) - 2015
- [j78]Venkatesan Guruswami, Chaoping Xing:
Optimal rate algebraic list decoding using narrow ray class fields. J. Comb. Theory A 129: 160-183 (2015) - [j77]Ignacio Cascudo, Ronald Cramer, Diego Mirandola, Carles Padró, Chaoping Xing:
On Secret Sharing with Nonlinear Product Reconstruction. SIAM J. Discret. Math. 29(2): 1114-1131 (2015) - [j76]Lingfei Jin, Chaoping Xing:
New Binary Codes From Rational Function Fields. IEEE Trans. Inf. Theory 61(1): 60-65 (2015) - [j75]Lingfei Jin, Chaoping Xing, Xiande Zhang:
On the List-Decodability of Random Self-Orthogonal Codes. IEEE Trans. Inf. Theory 61(2): 820-828 (2015) - [c20]Ronald Cramer, Carles Padró, Chaoping Xing:
Optimal Algebraic Manipulation Detection Codes in the Constant-Error Model. TCC (1) 2015: 481-501 - [p2]Liming Ma, Chaoping Xing:
Constructions of block codes from algebraic curves over finite fields. Surveys in Combinatorics 2015: 295-324 - [i28]Ronald Cramer, Chaoping Xing:
An Improvement on the Hasse-Weil Bound and applications to Character Sums, Cryptography and Coding. CoRR abs/1505.01700 (2015) - [i27]Venkatesan Guruswami, Lingfei Jin, Chaoping Xing:
Efficient list decoding of punctured Reed-Muller codes. CoRR abs/1508.00603 (2015) - [i26]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) - [i25]Keqin Feng, Lingfei Jin, Chaoping Xing, Chen Yuan:
Multipartite entangled states, symmetric matrices and error-correcting codes. CoRR abs/1511.07992 (2015) - [i24]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
- [j74]San Ling, Enver Ozdemir, Chaoping Xing:
A relation between embedding degrees and class numbers of binary quadratic forms. Math. Comput. 83(290): 3001-3004 (2014) - [j73]Xun Yi, Elisa Bertino, Jaideep Vaidya, Chaoping Xing:
Private Searching on Streaming Data Based on Keyword Frequency. IEEE Trans. Dependable Secur. Comput. 11(2): 155-167 (2014) - [j72]Oriol Farràs, Carles Padró, Chaoping Xing, An Yang:
Natural Generalizations of Threshold Secret Sharing. IEEE Trans. Inf. Theory 60(3): 1652-1664 (2014) - [j71]Lingfei Jin, Chaoping Xing:
A Construction of New Quantum MDS Codes. IEEE Trans. Inf. Theory 60(5): 2921-2925 (2014) - [j70]Ignacio Cascudo, Ronald Cramer, Chaoping Xing:
Torsion Limits and Riemann-Roch Systems for Function Fields and Applications. IEEE Trans. Inf. Theory 60(7): 3871-3888 (2014) - [j69]Yang Ding, Lingfei Jin, Chaoping Xing:
Erasure List-Decodable Codes From Random and Algebraic Geometry Codes. IEEE Trans. Inf. Theory 60(7): 3889-3894 (2014) - [j68]Harald Niederreiter, Chaoping Xing:
Sequences With High Nonlinear Complexity. IEEE Trans. Inf. Theory 60(10): 6696-6701 (2014) - [c19]Venkatesan Guruswami, Chaoping Xing:
Hitting Sets for Low-Degree Polynomials with Optimal Density. CCC 2014: 161-168 - [c18]Yeow Meng Chee, Liyasi Wu, Chaoping Xing:
Correcting on curves and highly sound locally correctable codes of high rate. ISIT 2014: 2964-2966 - [c17]Venkatesan Guruswami, Chaoping Xing:
Optimal rate list decoding of folded algebraic-geometric codes over constant-sized alphabets. SODA 2014: 1858-1866 - [p1]Gerhard Larcher, Friedrich Pillichshammer, Arne Winterhof, Chaoping Xing:
Some highlights of Harald Niederreiter's work. Applied Algebra and Number Theory 2014: 1-21 - [e5]Gerhard Larcher, Friedrich Pillichshammer, Arne Winterhof, Chaoping Xing:
Applied Algebra and Number Theory. Cambridge University Press 2014, ISBN 9781139696456 [contents] - [i23]Yang Ding, Lingfei Jin, Chaoping Xing:
Erasure List-Decodable Codes from Random and Algebraic Geometry Codes. CoRR abs/1401.2716 (2014) - [i22]Ronald Cramer, Carles Padró, Chaoping Xing:
Optimal Algebraic Manipulation Detection Codes. IACR Cryptol. ePrint Arch. 2014: 116 (2014) - [i21]Ignacio Cascudo, Ronald Cramer, Chaoping Xing:
Torsion Limits and Riemann-Roch Systems for Function Fields and Applications. IACR Cryptol. ePrint Arch. 2014: 298 (2014) - 2013
- [j67]Fang-Wei Fu, San Ling, Chaoping Xing:
New results on two hypercube coloring problems. Discret. Appl. Math. 161(18): 2937-2945 (2013) - [j66]Alp Bassa, Liming Ma, Chaoping Xing, Sze Ling Yeo:
Towards a characterization of subfields of the Deligne-Lusztig function fields. J. Comb. Theory A 120(7): 1351-1371 (2013) - [j65]Simeon Ball, Carles Padró, Zsuzsa Weiner, Chaoping Xing:
On the Representability of the Biuniform Matroid. SIAM J. Discret. Math. 27(3): 1482-1491 (2013) - [j64]Ignacio Cascudo Pueyo, Ronald Cramer, Chaoping Xing:
Bounds on the Threshold Gap in Secret Sharing and its Applications. IEEE Trans. Inf. Theory 59(9): 5600-5612 (2013) - [j63]Michael Kaminski, Chaoping Xing:
An Upper Bound on the Complexity of Multiplication of Polynomials Modulo a Power of an Irreducible Polynomial. IEEE Trans. Inf. Theory 59(10): 6845-6850 (2013) - [c16]Venkatesan Guruswami, Chaoping Xing:
List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound. STOC 2013: 843-852 - [i20]Venkatesan Guruswami, Chaoping Xing:
Optimal rate algebraic list decoding using narrow ray class fields. CoRR abs/1302.6660 (2013) - [i19]Lingfei Jin, Chaoping Xing:
Euclidean and Hermitian Self-orthogonal Algebraic Geometry Codes and Their Application to Quantum Codes. CoRR abs/1308.3575 (2013) - [i18]Lingfei Jin, Chaoping Xing:
A Construction of Quantum Codes via A Class of Classical Polynomial Codes. CoRR abs/1308.3577 (2013) - [i17]Lingfei Jin, Chaoping Xing:
Quantum Gilbert-Varshamov Bound Through Symplectic Self-Orthogonal Codes. CoRR abs/1308.3578 (2013) - [i16]Lingfei Jin, Chaoping Xing:
A Construction of New Quantum MDS Codes. CoRR abs/1311.3009 (2013) - [i15]Harald Niederreiter, Chaoping Xing:
Sequences with high nonlinear complexity. CoRR abs/1312.1583 (2013) - [i14]Venkatesan Guruswami, Chaoping Xing:
Optimal rate list decoding of folded algebraic-geometric codes over constant-sized alphabets. Electron. Colloquium Comput. Complex. TR13 (2013) - [i13]Venkatesan Guruswami, Chaoping Xing:
Hitting Sets for Low-Degree Polynomials with Optimal Density. Electron. Colloquium Comput. Complex. TR13 (2013) - [i12]Ignacio Cascudo Pueyo, Ronald Cramer, Diego Mirandola, Carles Padró, Chaoping Xing:
On secret sharing with nonlinear product reconstruction. IACR Cryptol. ePrint Arch. 2013: 503 (2013) - 2012
- [j62]San Ling, Enver Ozdemir, Chaoping Xing:
Constructing irreducible polynomials over finite fields. Math. Comput. 81(279): 1663-1668 (2012) - [j61]Yang Ding, Lingfei Jin, Chaoping Xing:
Good Linear Codes from Polynomial Evaluations. IEEE Trans. Commun. 60(2): 357-363 (2012) - [j60]Ignacio Cascudo Pueyo, Ronald Cramer, Chaoping Xing, An Yang:
Asymptotic Bound for Multiplication Complexity in the Extensions of Small Finite Fields. IEEE Trans. Inf. Theory 58(7): 4930-4935 (2012) - [j59]Lingfei Jin, Chaoping Xing:
Euclidean and Hermitian Self-Orthogonal Algebraic Geometry Codes and Their Application to Quantum Codes. IEEE Trans. Inf. Theory 58(8): 5484-5489 (2012) - [c15]Lingfei Jin, Chaoping Xing:
A construction of quantum codes via a class of classical polynomial codes. ISIT 2012: 339-342 - [c14]Ignacio Cascudo, Ronald Cramer, Chaoping Xing:
The arithmetic codex. ITW 2012: 75-79 - [c13]Xun Yi, Chaoping Xing:
Private (t, n) Threshold Searching on Streaming Data. SocialCom/PASSAT 2012: 676-683 - [c12]Venkatesan Guruswami, Chaoping Xing:
Folded codes from function field towers and improved optimal rate list decoding. STOC 2012: 339-350 - [i11]Venkatesan Guruswami, Chaoping Xing:
Folded Codes from Function Field Towers and Improved Optimal Rate List Decoding. CoRR abs/1204.4209 (2012) - [i10]Ignacio Cascudo Pueyo, Ronald Cramer, Chaoping Xing:
Torsion Limits and Riemann-Roch Systems for Function Fields and Applications. CoRR abs/1207.2936 (2012) - [i9]Yun Fan, San Ling, Hongwei Liu, Jing Shen, Chaoping Xing:
Cumulative Distance Enumerators of Random Codes and their Thresholds. CoRR abs/1212.5679 (2012) - [i8]Venkatesan Guruswami, Chaoping Xing:
Folded Codes from Function Field Towers and Improved Optimal Rate List Decoding. Electron. Colloquium Comput. Complex. TR12 (2012) - [i7]Venkatesan Guruswami, Chaoping Xing:
List decoding Reed-Solomon, Algebraic-Geometric, and Gabidulin subcodes up to the Singleton bound. Electron. Colloquium Comput. Complex. TR12 (2012) - [i6]Ignacio Cascudo Pueyo, Ronald Cramer, Chaoping Xing:
Bounds on the Threshold Gap in Secret Sharing over Small Fields. IACR Cryptol. ePrint Arch. 2012: 319 (2012) - [i5]Ignacio Cascudo Pueyo, Ronald Cramer, Chaoping Xing:
The Arithmetic Codex. IACR Cryptol. ePrint Arch. 2012: 388 (2012) - [i4]Oriol Farràs, Carles Padró, Chaoping Xing, An Yang:
Natural Generalizations of Threshold Secret Sharing. IACR Cryptol. ePrint Arch. 2012: 680 (2012) - 2011
- [j58]Chaoping Xing, Sze Ling Yeo:
A Gilbert-Varshamov-type bound for lattice packings. J. Comb. Theory A 118(3): 938-948 (2011) - [j57]Frédéric A. B. Edoukou, San Ling, Chaoping Xing:
Structure of functional codes defined on non-degenerate Hermitian varieties. J. Comb. Theory A 118(8): 2436-2444 (2011) - [j56]Yan Jia, San Ling, Chaoping Xing:
On Self-Dual Cyclic Codes Over Finite Fields. IEEE Trans. Inf. Theory 57(4): 2243-2251 (2011) - [j55]Chaoping Xing:
Asymptotically Good Nonlinear Codes From Algebraic Curves. IEEE Trans. Inf. Theory 57(9): 5991-5995 (2011) - [c11]Oriol Farràs, Carles Padró, Chaoping Xing, An Yang:
Natural Generalizations of Threshold Secret Sharing. ASIACRYPT 2011: 610-627 - [c10]Ignacio Cascudo Pueyo, Ronald Cramer, Chaoping Xing:
The Torsion-Limit for Algebraic Function Fields and Its Application to Arithmetic Secret Sharing. CRYPTO 2011: 685-705 - [c9]Lingfei Jin, Chaoping Xing:
Quantum Gilbert-Varshamov bound through symplectic self-orthogonal codes. ISIT 2011: 455-458 - [e4]Yeow Meng Chee, Zhenbo Guo, San Ling, Fengjing Shao, Yuansheng Tang, Huaxiong Wang, Chaoping Xing:
Coding and Cryptology - Third International Workshop, IWCC 2011, Qingdao, China, May 30-June 3, 2011. Proceedings. Lecture Notes in Computer Science 6639, Springer 2011, ISBN 978-3-642-20900-0 [contents] - 2010
- [j54]Yeow Meng Chee, Chaoping Xing, Sze Ling Yeo:
New constant-weight codes from propagation rules. IEEE Trans. Inf. Theory 56(4): 1596-1599 (2010) - [j53]Long Wang, Keqin Feng, San Ling, Chaoping Xing:
Asymmetric quantum codes: characterization and constructions. IEEE Trans. Inf. Theory 56(6): 2938-2945 (2010) - [j52]San Ling, Jinquan Luo, Chaoping Xing:
Generalization of Steane's enlargement construction of quantum codes and applications. IEEE Trans. Inf. Theory 56(8): 4080-4084 (2010) - [j51]Lingfei Jin, San Ling, Jinquan Luo, Chaoping Xing:
Application of classical hermitian self-orthogonal MDS codes to quantum MDS codes. IEEE Trans. Inf. Theory 56(9): 4735-4740 (2010) - [i3]Yeow Meng Chee, Chaoping Xing, Sze Ling Yeo:
New Constant-Weight Codes from Propagation Rules. CoRR abs/1008.1610 (2010)
2000 – 2009
- 2009
- [j50]Chaoping Xing, Yang Ding:
Multisequences with large linear and k-error linear complexity from Hermitian function fields. IEEE Trans. Inf. Theory 55(8): 3858-3863 (2009) - [c8]Ignacio Cascudo Pueyo, Hao Chen, Ronald Cramer, Chaoping Xing:
Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field. CRYPTO 2009: 466-486 - [c7]Hao Chen, San Ling, Carles Padró, Huaxiong Wang, Chaoping Xing:
Key Predistribution Schemes and One-Time Broadcast Encryption Schemes from Algebraic Geometry Codes. IMACC 2009: 263-277 - [e3]Yeow Meng Chee, Chao Li, San Ling, Huaxiong Wang, Chaoping Xing:
Coding and Cryptology, Second International Workshop, IWCC 2009, Zhangjiajie, China, June 1-5, 2009. Proceedings. Lecture Notes in Computer Science 5557, Springer 2009, ISBN 978-3-642-01813-8 [contents] - [i2]Jinquan Luo, San Ling, Chaoping Xing:
Cyclic Codes and Sequences from a Class of Dembowski-Ostrom Functions. CoRR abs/0902.4509 (2009) - [i1]Jinquan Luo, San Ling, Chaoping Xing:
Cyclic Codes and Sequences from Kasami-Welch Functions. CoRR abs/0902.4511 (2009) - 2008
- [j49]Dirk Hachenberger, Harald Niederreiter, Chaoping Xing:
Function-field codes. Appl. Algebra Eng. Commun. Comput. 19(3): 201-211 (2008) - [j48]Chaoping Xing:
Dense packings from quadratic fields and codes. J. Comb. Theory A 115(6): 1021-1035 (2008) - [j47]Gabriele Nebe, Chaoping Xing:
A Gilbert-Varshamov type bound for Euclidean packings. Math. Comput. 77(264): 2339-2344 (2008) - [j46]Hao Chen, San Ling, Chaoping Xing:
Access Structures of Elliptic Secret Sharing Schemes. IEEE Trans. Inf. Theory 54(2): 850-852 (2008) - 2007
- [j45]Chaoping Xing:
Diagonal Lattice Space-Time Codes From Number Fields and Asymptotic Bounds. IEEE Trans. Inf. Theory 53(11): 3921-3926 (2007) - [j44]Chaoping Xing, Sze Ling Yeo:
New Linear Codes and Algebraic Function Fields Over Finite Fields. IEEE Trans. Inf. Theory 53(12): 4822-4825 (2007) - [e2]Feng Bao, San Ling, Tatsuaki Okamoto, Huaxiong Wang, Chaoping Xing:
Cryptology and Network Security, 6th International Conference, CANS 2007, Singapore, December 8-10, 2007, Proceedings. Lecture Notes in Computer Science 4856, Springer 2007, ISBN 978-3-540-76968-2 [contents] - 2006
- [j43]San Ling, Chaoping Xing, Ferruh Özbudak:
An explicit class of codes with good parameters and their duals. Discret. Appl. Math. 154(2): 346-356 (2006) - [j42]Chaoping Xing:
Special issue on algebra and coding theory. Finite Fields Their Appl. 12(4): 493 (2006) - [j41]Keqin Feng, San Ling, Chaoping Xing:
Asymptotic bounds on quantum codes from algebraic geometry codes. IEEE Trans. Inf. Theory 52(3): 986-991 (2006) - 2005
- [j40]Fang-Wei Fu, San Ling, Chaoping Xing:
On the variance of average distance of subsets in the Hamming space. Discret. Appl. Math. 145(3): 465-478 (2005) - [j39]Chaoping Xing:
Goppa geometric codes achieving the Gilbert-Varshamov bound. IEEE Trans. Inf. Theory 51(1): 259-264 (2005) - [j38]Hao Chen, San Ling, Chaoping Xing:
Quantum codes from concatenated algebraic-geometric codes. IEEE Trans. Inf. Theory 51(8): 2915-2920 (2005) - [j37]Chaoping Xing, Jie Ling:
A construction of binary constant-weight codes from algebraic curves over finite fields. IEEE Trans. Inf. Theory 51(10): 3674-3678 (2005) - [j36]Henning Stichtenoth, Chaoping Xing:
Excellent nonlinear codes from algebraic function fields. IEEE Trans. Inf. Theory 51(11): 4044-4046 (2005) - 2004
- [j35]Cunsheng Ding, Chaoping Xing:
Special issue on cryptography and coding theory. J. Complex. 20(2-3): 133- (2004) - [j34]Cunsheng Ding, Chaoping Xing:
A short biography of Harald Niederreiter. J. Complex. 20(2-3): 134-136 (2004) - [j33]Cunsheng Ding, Chaoping Xing:
Cyclotomic Optical Orthogonal Codes of Composite Lengths. IEEE Trans. Commun. 52(2): 263-268 (2004) - [j32]San Ling, Chaoping Xing:
Polyadic codes revisited. IEEE Trans. Inf. Theory 50(1): 200-207 (2004) - [j31]Chaoping Xing:
Linear codes from narrow ray class groups of algebraic curves. IEEE Trans. Inf. Theory 50(3): 541-543 (2004) - [j30]Chaoping Xing, Yang Fang:
A class of polynomial codes. IEEE Trans. Inf. Theory 50(5): 884-887 (2004) - [j29]Harald Niederreiter, Chaoping Xing:
Disjoint Linear Codes From Algebraic Function Fields. IEEE Trans. Inf. Theory 50(9): 2174-2177 (2004) - 2003
- [j28]Cunsheng Ding, Chaoping Xing:
Several Classes of (2m-1, w, 2) Optical Orthogonal Codes. Discret. Appl. Math. 128(1): 103-120 (2003) - [j27]Huaxiong Wang, Chaoping Xing, Reihaneh Safavi-Naini:
Linear authentication codes: bounds and constructions. IEEE Trans. Inf. Theory 49(4): 866-872 (2003) - [j26]Chaoping Xing, P. Vijay Kumar, Cunsheng Ding:
Low-correlation, large linear span sequences from function fields. IEEE Trans. Inf. Theory 49(6): 1439-1446 (2003) - [j25]Chaoping Xing:
Nonlinear codes from algebraic curves improving the Tsfasman-Vladut-Zink bound. IEEE Trans. Inf. Theory 49(7): 1653-1657 (2003) - [j24]Fang-Wei Fu, San Ling, Chaoping Xing:
New lower bounds and constructions for binary codes correcting asymmetric errors. IEEE Trans. Inf. Theory 49(12): 3294-3299 (2003) - [c6]Josef Pieprzyk, Huaxiong Wang, Chaoping Xing:
Multiple-Time Signature Schemes against Adaptive Chosen Message Attacks. Selected Areas in Cryptography 2003: 88-100 - 2002
- [j23]Ka Hin Leung, San Ling, Chaoping Xing:
New binary linear codes from algebraic curves. IEEE Trans. Inf. Theory 48(1): 285-287 (2002) - [j22]Chaoping Xing, Hao Chen:
Improvements on parameters of one-point AG Codes from Hermitian curves. IEEE Trans. Inf. Theory 48(2): 535-537 (2002) - [j21]Cunsheng Ding, Tor Helleseth, Harald Niederreiter, Chaoping Xing:
The minimum distance of the duals of binary irreducible cyclic codes. IEEE Trans. Inf. Theory 48(10): 2679-2689 (2002) - [j20]Chaoping Xing:
Asymptotic bounds on frameproof codes. IEEE Trans. Inf. Theory 48(11): 2991-2995 (2002) - [j19]Chaoping Xing:
Constructions of codes from residue rings of polynomials. IEEE Trans. Inf. Theory 48(11): 2995-2997 (2002) - 2001
- [j18]Cunsheng Ding, Chaoping Xing:
Several Classes of (2m - 1, w, 2) Optical Orthogonal Codes. Electron. Notes Discret. Math. 6: 72-97 (2001) - [j17]Huaxiong Wang, Chaoping Xing:
Explicit Constructions of Perfect Hash Families from Algebraic Curves over Finite Fields. J. Comb. Theory A 93(1): 112-124 (2001) - [j16]Chaoping Xing:
Algebraic-geometry codes with asymptotic parameters better than the Gilbert-Varshamov and the Tsfasman-Vladut-Zink bounds. IEEE Trans. Inf. Theory 47(1): 347-352 (2001) - [j15]Hao Chen, San Ling, Chaoping Xing:
Asymptotically good quantum codes exceeding the Ashikhmin-Litsyn-Tsfasman bound. IEEE Trans. Inf. Theory 47(5): 2055-2058 (2001) - [c5]Reihaneh Safavi-Naini, Huaxiong Wang, Chaoping Xing:
Linear Authentication Codes: Bounds and Constructions. INDOCRYPT 2001: 127-135 - [c4]Chaoping Xing:
Constructions of Sequences from Algebraic Curves over Finite Fields. SETA 2001: 88-100 - 2000
- [j14]Harald Niederreiter, Chaoping Xing:
A Propagation Rule for Linear Codes. Appl. Algebra Eng. Commun. Comput. 10(6): 425-432 (2000) - [j13]Chaoping Xing:
Multi-sequences with Almost Perfect Linear Complexity Profile and Function Fields over Finite Fields. J. Complex. 16(4): 661-675 (2000) - [j12]Chaoping Xing, Huaxiong Wang, Kwok-Yan Lam:
Constructions of authentication codes from algebraic curves over finite fields. IEEE Trans. Inf. Theory 46(3): 886-892 (2000) - [j11]Chaoping Xing, San Ling:
A class of linear codes with good parameters from algebraic curves. IEEE Trans. Inf. Theory 46(4): 1527-1532 (2000) - [j10]Chaoping Xing, San Ling:
A class of linear codes with good parameters. IEEE Trans. Inf. Theory 46(6): 2184-2188 (2000) - [j9]Cunsheng Ding, Harald Niederreiter, Chaoping Xing:
Some new codes from algebraic curves. IEEE Trans. Inf. Theory 46(7): 2638-2642 (2000)
1990 – 1999
- 1999
- [j8]Harald Niederreiter, Chaoping Xing, Kwok-Yan Lam:
A New Construction of Algebraic Geometry Codes. Appl. Algebra Eng. Commun. Comput. 9(5): 373-381 (1999) - [j7]Cunsheng Ding, Kwok-Yan Lam, Chaoping Xing:
Construction and Enumeration of All Binary Duadic Codes of Length pm. Fundam. Informaticae 38(1-2): 149-161 (1999) - [j6]Ming-Deh A. Huang, Chaoping Xing:
Some Computational Problems of Cryptographic Significance Concerning Elliptic Curves over Rings. Inf. Comput. 151(1-2): 92-99 (1999) - [j5]Chaoping Xing, Harald Niederreiter, Kwok-Yan Lam:
Constructions of Algebraic-Geometry Codes. IEEE Trans. Inf. Theory 45(4): 1186-1193 (1999) - [j4]Chaoping Xing, Kwok-Yan Lam:
Sequences with Almost Perfect Linear Complexity Profiles and Curves Over Finite Fields. IEEE Trans. Inf. Theory 45(4): 1267-1270 (1999) - [j3]Chaoping Xing, Harald Niederreiter, Kwok-Yan Lam:
A generalization of algebraic-geometry codes. IEEE Trans. Inf. Theory 45(7): 2498-2501 (1999) - [c3]Chaoping Xing, Kwok-Yan Lam, Zhenghong Wei:
A Class of Explicit Perfect Multi-sequences. ASIACRYPT 1999: 299-305 - [e1]Kwok-Yan Lam, Eiji Okamoto, Chaoping Xing:
Advances in Cryptology - ASIACRYPT '99, International Conference on the Theory and Applications of Cryptology and Information Security, Singapore, November 14-18, 1999, Proceedings. Lecture Notes in Computer Science 1716, Springer 1999, ISBN 3-540-66666-4 [contents] - 1998
- [c2]Harald Niederreiter, Chaoping Xing:
A General Method of Constructing Global Function Fields. ANTS 1998: 555-566 - [c1]David R. Kohel, San Ling, Chaoping Xing:
Explicit Sequence Expansions. SETA 1998: 308-317 - 1995
- [j2]Chaoping Xing:
On Automorphism Groups of the Hermitian Codes. IEEE Trans. Inf. Theory 41(6): 1629-1635 (1995) - 1992
- [j1]Chaoping Xing:
When are two geometric Goppa codes equal? IEEE Trans. Inf. Theory 38(3): 1140-1142 (1992)
Coauthor Index
Ignacio Cascudo
aka: Ignacio Cascudo Pueyo
aka: Ignacio Cascudo Pueyo
[j125] [j123] [i104] [j121] [j115] [c43] [c42] [c41] [c40] [i98] [i92] [i91] [i90] [i89] [j109] [c38] [i88] [i83] [c35] [i76] [j100] [j99] [c34] [c32] [i69] [j93] [j92] [j91] [c29] [i66] [i61] [i58] [j87] [j86] [c27] [c25] [i56] [i55] [i53] [i51] [i50] [i47] [j84] [j81] [c23] [c22] [i43] [i36] [i33] [i31] [i30] [i26] [i25] [i24]
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-13 18:02 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:
