Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarChaoping 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
2010 – today
- 2019
[j90]Xudong Li, Liming Ma, Chaoping Xing:
Optimal Locally Repairable Codes Via Elliptic Curves. IEEE Trans. Information Theory 65(1): 108-117 (2019)- [j89]Yuan Luo, Chaoping Xing, Chen Yuan:
Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes. IEEE Trans. Information Theory 65(2): 1048-1053 (2019) - 2018
- [j88]Lingfei Jin, Yuan Luo, Chaoping Xing:
Repairing Algebraic Geometry Codes. IEEE Trans. Information 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. Information 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. Information 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. Information Theory 64(9): 6277-6282 (2018) - [c25]Venkatesan Guruswami, Chaoping Xing, Chen Yuan:
How Long Can Optimal Locally Repairable Codes Be?. APPROX-RANDOM 2018: 41:1-41:11 - [c24]Venkatesan Guruswami, Nicolas Resch, Chaoping Xing:
Lossless Dimension Expanders via Linearized Polynomials and Subspace Designs. CCC 2018: 4:1-4:16 - [c23]Ignacio Cascudo, Ronald Cramer, Chaoping Xing, Chen Yuan:
Amortized Complexity of Information-Theoretically Secure MPC Revisited. CRYPTO (3) 2018: 395-426 - [c22]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. Electronic Colloquium on Computational Complexity (ECCC) 25: 17 (2018) - [i47]Ignacio Cascudo, Ronald Cramer, Chaoping Xing, Chen Yuan:
Amortized Complexity of Information-Theoretically Secure MPC Revisited. IACR Cryptology ePrint Archive 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 Cryptology ePrint Archive 2018: 482 (2018) - [i45]Zhe Li, Chaoping Xing, Sze Ling Yeo:
Reducing the Key Size of McEliece Cryptosystem from Goppa Codes via Permutations. IACR Cryptology ePrint Archive 2018: 1029 (2018) - 2017
- [j84]Shu Liu, Chaoping Xing, Chen Yuan:
List Decodability of Random Subcodes of Gabidulin Codes. IEEE Trans. Information Theory 63(1): 159-163 (2017) - [j83]Lingfei Jin, Chaoping Xing:
New MDS Self-Dual Codes From Generalized Reed - Solomon Codes. IEEE Trans. Information Theory 63(3): 1434-1438 (2017) - [j82]Venkatesan Guruswami, Lingfei Jin, Chaoping Xing:
Efficiently List-Decodable Punctured Reed-Muller Codes. IEEE Trans. Information 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. Information 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. Information Theory 63(12): 7646-7650 (2017) - [c21]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 - [c20]Venkatesan Guruswami, Chaoping Xing, Chen Yuan:
Subspace Designs Based on Algebraic Function Fields. ICALP 2017: 86:1-86:10 - [c19]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. Electronic Colloquium on Computational Complexity (ECCC) 24: 64 (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 Cryptology ePrint Archive 2017: 1002 (2017) - 2016
- [j79]Venkatesan Guruswami, Carol Wang, Chaoping Xing:
Explicit List-Decodable Rank-Metric and Subspace Codes via Subspace Designs. IEEE Trans. Information 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. Electronic Colloquium on Computational Complexity (ECCC) 23: 51 (2016) - [i30]Ronald Cramer, Chaoping Xing, Chen Yuan:
On Multi-Point Local Decoding of Reed-Muller Codes. IACR Cryptology ePrint Archive 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 Cryptology ePrint Archive 2016: 397 (2016) - 2015
- [j78]Venkatesan Guruswami, Chaoping Xing:
Optimal rate algebraic list decoding using narrow ray class fields. J. Comb. Theory, Ser. 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. Discrete Math. 29(2): 1114-1131 (2015) - [j76]Lingfei Jin, Chaoping Xing:
New Binary Codes From Rational Function Fields. IEEE Trans. Information Theory 61(1): 60-65 (2015) - [j75]Lingfei Jin, Chaoping Xing, Xiande Zhang:
On the List-Decodability of Random Self-Orthogonal Codes. IEEE Trans. Information Theory 61(2): 820-828 (2015) - [c18]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. Electronic Colloquium on Computational Complexity (ECCC) 22: 161 (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 Sec. Comput. 11(2): 155-167 (2014) - [j72]Oriol Farràs, Carles Padró, Chaoping Xing, An Yang:
Natural Generalizations of Threshold Secret Sharing. IEEE Trans. Information Theory 60(3): 1652-1664 (2014) - [j71]Lingfei Jin, Chaoping Xing:
A Construction of New Quantum MDS Codes. IEEE Trans. Information 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. Information 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. Information Theory 60(7): 3889-3894 (2014) - [j68]Harald Niederreiter, Chaoping Xing:
Sequences With High Nonlinear Complexity. IEEE Trans. Information Theory 60(10): 6696-6701 (2014) - [c17]Venkatesan Guruswami, Chaoping Xing:
Hitting Sets for Low-Degree Polynomials with Optimal Density. IEEE Conference on Computational Complexity 2014: 161-168 - [c16]Yeow Meng Chee, Liyasi Wu, Chaoping Xing:
Correcting on curves and highly sound locally correctable codes of high rate. ISIT 2014: 2964-2966 - [c15]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 Cryptology ePrint Archive 2014: 116 (2014) - [i21]Ignacio Cascudo, Ronald Cramer, Chaoping Xing:
Torsion Limits and Riemann-Roch Systems for Function Fields and Applications. IACR Cryptology ePrint Archive 2014: 298 (2014) - 2013
- [j67]Fang-Wei Fu, San Ling, Chaoping Xing:
New results on two hypercube coloring problems. Discrete Applied Mathematics 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, Ser. A 120(7): 1351-1371 (2013) - [j65]Simeon Ball, Carles Padró, Zsuzsa Weiner, Chaoping Xing:
On the Representability of the Biuniform Matroid. SIAM J. Discrete 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. Information 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. Information Theory 59(10): 6845-6850 (2013) - [c14]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]
- [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. Electronic Colloquium on Computational Complexity (ECCC) 20: 46 (2013) - [i13]Venkatesan Guruswami, Chaoping Xing:
Hitting Sets for Low-Degree Polynomials with Optimal Density. Electronic Colloquium on Computational Complexity (ECCC) 20: 175 (2013) - [i12]Ignacio Cascudo Pueyo, Ronald Cramer, Diego Mirandola, Carles Padró, Chaoping Xing:
On secret sharing with nonlinear product reconstruction. IACR Cryptology ePrint Archive 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. Communications 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. Information 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. Information Theory 58(8): 5484-5489 (2012) - [c13]Lingfei Jin, Chaoping Xing:
A construction of quantum codes via a class of classical polynomial codes. ISIT 2012: 339-342 - [c12]
- [c11]Xun Yi, Chaoping Xing:
Private (t, n) Threshold Searching on Streaming Data. SocialCom/PASSAT 2012: 676-683 - [c10]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. Electronic Colloquium on Computational Complexity (ECCC) 19: 36 (2012) - [i7]Venkatesan Guruswami, Chaoping Xing:
List decoding Reed-Solomon, Algebraic-Geometric, and Gabidulin subcodes up to the Singleton bound. Electronic Colloquium on Computational Complexity (ECCC) 19: 146 (2012) - [i6]Ignacio Cascudo Pueyo, Ronald Cramer, Chaoping Xing:
Bounds on the Threshold Gap in Secret Sharing over Small Fields. IACR Cryptology ePrint Archive 2012: 319 (2012) - [i5]Ignacio Cascudo Pueyo, Ronald Cramer, Chaoping Xing:
The Arithmetic Codex. IACR Cryptology ePrint Archive 2012: 388 (2012) - [i4]Oriol Farràs, Carles Padró, Chaoping Xing, An Yang:
Natural Generalizations of Threshold Secret Sharing. IACR Cryptology ePrint Archive 2012: 680 (2012) - 2011
- [j58]Chaoping Xing, Sze Ling Yeo:
A Gilbert-Varshamov-type bound for lattice packings. J. Comb. Theory, Ser. 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, Ser. A 118(8): 2436-2444 (2011) - [j56]Yan Jia, San Ling, Chaoping Xing:
On Self-Dual Cyclic Codes Over Finite Fields. IEEE Trans. Information Theory 57(4): 2243-2251 (2011) - [j55]Chaoping Xing:
Asymptotically Good Nonlinear Codes From Algebraic Curves. IEEE Trans. Information Theory 57(9): 5991-5995 (2011) - [c9]Oriol Farràs, Carles Padró, Chaoping Xing, An Yang:
Natural Generalizations of Threshold Secret Sharing. ASIACRYPT 2011: 610-627 - [c8]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 - [c7]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. Information Theory 56(4): 1596-1599 (2010) - [j53]Long Wang, Keqin Feng, San Ling, Chaoping Xing:
Asymmetric quantum codes: characterization and constructions. IEEE Trans. Information 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. Information 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. Information 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. Information Theory 55(8): 3858-3863 (2009) - [c6]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 - [c5]Hao Chen, San Ling, Carles Padró, Huaxiong Wang, Chaoping Xing:
Key Predistribution Schemes and One-Time Broadcast Encryption Schemes from Algebraic Geometry Codes. IMA Int. Conf. 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, Ser. 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. Information Theory 54(2): 850-852 (2008) - 2007
- [j45]