Lifted Multiplicity Codes and the Disjoint Repair Group Property
暂无分享,去创建一个
[1] Itzhak Tamo,et al. Bounds on the Parameters of Locally Recoverable Codes , 2015, IEEE Transactions on Information Theory.
[2] Swastik Kopparty,et al. List-Decoding Multiplicity Codes , 2012, Theory Comput..
[3] Swastik Kopparty. Some remarks on multiplicity codes , 2013, Discrete Geometry and Algebraic Combinatorics.
[4] Vitaly Skachek,et al. Batch and PIR Codes and Their Connections to Locally-Repairable Codes , 2016, ArXiv.
[5] Dimitris S. Papailiopoulos,et al. Locality and Availability in Distributed Storage , 2014, IEEE Transactions on Information Theory.
[6] Francis Y. L. Chin. A Generalized Asymptotic Upper Bound on Fast Polynomial Evaluation and Interpolation , 1976, SIAM J. Comput..
[7] Zhifang Zhang,et al. Repair Locality With Multiple Erasure Tolerance , 2014, IEEE Transactions on Information Theory.
[8] Venkatesan Guruswami,et al. Linear-Algebraic List Decoding for Variants of Reed–Solomon Codes , 2013, IEEE Transactions on Information Theory.
[9] Tuvi Etzion,et al. PIR array codes with optimal PIR rates , 2016, 2017 IEEE International Symposium on Information Theory (ISIT).
[10] YekhaninSergey,et al. High-rate codes with sublinear-time decoding , 2014 .
[11] Rafail Ostrovsky,et al. Local correctability of expander codes , 2013, Inf. Comput..
[12] Alexandros G. Dimakis,et al. Batch codes through dense graphs without short cycles , 2014, 2015 IEEE International Symposium on Information Theory (ISIT).
[13] Alexander Vardy,et al. Lower Bound on the Redundancy of PIR Codes , 2016, ArXiv.
[14] Rafail Ostrovsky,et al. Batch codes and their applications , 2004, STOC '04.
[15] Or Meir,et al. High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity , 2015, STOC.
[16] Eitan Yaakobi,et al. Nearly optimal constructions of PIR and batch codes , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).
[17] Eitan Yaakobi,et al. Codes for distributed PIR with low storage overhead , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).
[18] Itzhak Tamo,et al. Bounds on locally recoverable codes with multiple recovering sets , 2014, 2014 IEEE International Symposium on Information Theory.
[19] Jonathan Katz,et al. On the efficiency of local decoding procedures for error-correcting codes , 2000, STOC '00.
[20] David P. Woodruff. A Quadratic Lower Bound for Three-Query Linear Locally Decodable Codes over Any Field , 2010, Journal of Computer Science and Technology.
[21] Venkatesan Guruswami,et al. Locality via Partially Lifted Codes , 2017, APPROX-RANDOM.
[22] Liyasi Wu. Revisiting the multiplicity codes: A new class of high-rate locally correctable codes , 2015, 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[23] L. Litwin,et al. Error control coding , 2001 .
[24] Alan Guo,et al. New affine-invariant codes from lifting , 2012, ITCS '13.