Advanced search    

Search: authors:"Chaoping Xing"

6 papers found.
Use AND, OR, NOT, +word, -word, "long phrase", (parentheses) to fine-tune your search.

Construction of Optimal Locally Recoverable Codes and Connection with Hypergraph

, Complexity and Games 0 Chaoping Xing School of Electronics, Information and Electrical Engineering, Shanghai Jiaotong University , Shanghai, 200240 , P. R. China Locally recoverable codes are a class of block ... 5 and 6 via binary constant weight codes . CoRR , abs/ 1808 .04558, 2018 . arXiv: 1808 .04558. Lingfei Jin , Liming Ma, and Chaoping Xing . Construction of optimal locally repairable codes via

Constructions of Maximally Recoverable Local Reconstruction Codes via Function Fields

Foundation of China under Grant 11871154. and phrases Erasure codes; Algebraic constructions; Linear algebra; Locally Repairable Codes; Explicit constructions - 68:2 Chaoping Xing: This research is ... , 2012 . Sivakanth Gopi , Venkatesan Guruswami, and Sergey Yekhanin . On maximally recoverable local reconstruction codes . arXiv preprint arXiv:1710.10322 , 2017 . Venkatesan Guruswami , Chaoping Xing

How Long Can Optimal Locally Repairable Codes Bel

A locally repairable code (LRC) with locality r allows for the recovery of any erased codeword symbol using only r other codeword symbols. A Singleton-type bound dictates the best possible trade-off between the dimension and distance of LRCs - an LRC attaining this trade-off is deemed optimal. Such optimal LRCs have been constructed over alphabets growing linearly in the block...

How Long Can Optimal Locally Repairable Codes Bel

Chaoping Xing School of Physical and Mathematical Sciences, Nanyang Technological University , Singapore. https://orcid.org/0000-0002-1257-1033 2 Computer Science Department, Carnegie Mellon University

Lossless Dimension Expanders via Linearized Polynomials and Subspace Designs

.4230/LIPIcs.APPROX-RANDOM. 2014 . 748 . Venkatesan Guruswami , Carol Wang , and Chaoping Xing . Explicit list-decodable rankmetric and subspace codes via subspace designs . IEEE Transactions on ... Information Theory , 62 ( 5 ): 2707 - 2718 , 2016 . Venkatesan Guruswami and Chaoping Xing . Folded codes from function field towers and improved optimal rate list decoding . In Howard J. Karloff and Toniann

Subspace Designs Based on Algebraic Function Fields

. doi:10 .1109/TIT. 2013 . 2246813 . Venkatesan Guruswami , Carol Wang , and Chaoping Xing . Explicit list-decodable rankmetric and subspace codes via subspace designs . IEEE Trans. Information Theory ... , 62 ( 5 ): 2707 - 2718 , 2016 . Preliminary versions in STOC 2013 and RANDOM 2014 . doi: 10 .1109/TIT. 2016 . 2544347 . Venkatesan Guruswami and Chaoping Xing . Folded codes from function fields and