Agarwal, 2018, Combinatorial alphabet-dependent bounds for locally recoverable codes, IEEE Trans. Inf. Theory, 64, 3481, 10.1109/TIT.2018.2800042
Aydin, 2001, The structure of 1-generator quasi-twisted codes and new linear codes, Des. Codes Cryptogr., 24, 313, 10.1023/A:1011283523000
Blackford, 2008, Negacyclic duadic codes, Finite Fields Appl., 14, 930, 10.1016/j.ffa.2008.05.004
Cadambe, 2015, Bounds on the size of locally recoverable codes, IEEE Trans. Inf. Theory, 61, 5787, 10.1109/TIT.2015.2477406
Chen, 2012, Constacyclic codes over finite fields, Finite Fields Appl., 18, 1217, 10.1016/j.ffa.2012.10.001
Chen, 2019, Constructions of optimal (r,δ) locally repairable codes via constacyclic codes, IEEE Trans. Commun., 67, 5253, 10.1109/TCOMM.2019.2916085
Chen, 2021, Improved bounds and Singleton-optimal constructions of locally repairable codes with minimum distance 5 and 6, IEEE Trans. Inf. Theory, 67, 217, 10.1109/TIT.2020.3036279
Chen, 2018, Constructions of optimal cyclic (r,δ) locally repairable codes, IEEE Trans. Inf. Theory, 64, 2499, 10.1109/TIT.2017.2761120
Dinh, 2010, Constacyclic codes of length ps over Fpm+uFpm, J. Algebra, 324, 940, 10.1016/j.jalgebra.2010.05.027
Fang, 2020, Perfect LRCs and k-optimal LRCs, 600
Fang, 2021, Singleton-optimal LRCs and perfect LRCs via cyclic codes, 3261
Fang, 2022, Perfect LRCs and k-optimal LRCs, Des. Codes Cryptogr.
Fang, 2017, A q-polynomial approach to constacyclic codes, Finite Fields Appl., 47, 161, 10.1016/j.ffa.2017.06.009
Gopalan, 2012, On the locality of codeword symbols, IEEE Trans. Inf. Theory, 58, 6925, 10.1109/TIT.2012.2208937
Goparaju, 2014, Binary cyclic codes that are locally repairable, 676
Guruswami, 2019, How long can optimal locally repairable codes be?, IEEE Trans. Inf. Theory, 65, 3662, 10.1109/TIT.2019.2891765
Hao, 2016, Some results on optimal locally repairable codes, 440
Hao, 2017, On optimal ternary locally repairable codes, 171
Hao, 2020, Bounds and constructions of locally repairable codes: parity-check matrix approach, IEEE Trans. Inf. Theory, 66, 7465, 10.1109/TIT.2020.3021707
Hartmann, 1972, Generalizations of the BCH bound, Inf. Control, 20, 489, 10.1016/S0019-9958(72)90887-X
Huang, 2012, Erasure coding in windows azure storage, 15
Huang, 2016, Binary linear locally repairable codes, IEEE Trans. Inf. Theory, 62, 6268, 10.1109/TIT.2016.2605119
Huffman, 2003
Jin, 2019, Explicit construction of optimal locally recoverable codes of distance 5 and 6 via binary constant weight codes, IEEE Trans. Inf. Theory, 65, 4658, 10.1109/TIT.2019.2901492
Jin, 2020, Construction of optimal locally repairable codes via automorphism groups of rational function fields, IEEE Trans. Inf. Theory, 66, 210, 10.1109/TIT.2019.2946637
Li, 2019, Optimal locally repairable codes via elliptic curves, IEEE Trans. Inf. Theory, 65, 108, 10.1109/TIT.2018.2844216
Lidl, 1997
Luo, 2019, Optimal locally repairable codes of distance 3 and 4 via cyclic codes, IEEE Trans. Inf. Theory, 65, 1048, 10.1109/TIT.2018.2854717
MacWilliams, 1977
Radkova, 2008, Bounds for the minimum distance in constacyclic codes, 236
Sathiamoorthy, 2013, XORing elephants: novel erasure codes for big data, 325
Song, 2014, Optimal locally repairable linear codes, IEEE J. Sel. Areas Commun., 32, 6925, 10.1109/JSAC.2014.140521
Tamo, 2014, A family of optimal locally recoverable codes, IEEE Trans. Inf. Theory, 60, 4661, 10.1109/TIT.2014.2321280
Tamo, 2015, Cyclic LRC codes and their subfield subcodes, 1262
Tamo, 2016, Optimal locally repairable codes and connections to matroid theory, IEEE Trans. Inf. Theory, 62, 6661, 10.1109/TIT.2016.2555813
Tebbi, 2019, Linear programming bounds for distributed storage codes, Adv. Math. Commun., 14, 333, 10.3934/amc.2020024
Wang, 2019, Bounds and constructions for linear locally repairable codes over binary fields, IEEE Trans. Inf. Theory, 65, 4167, 10.1109/TIT.2019.2895315
Xing, 2022, Construction of (r,δ) locally recoverable codes and connection with graph theory, IEEE Trans. Inf. Theory, 68, 4320, 10.1109/TIT.2022.3157612
Yang, 2015, On the self-dual constacyclic codes over the finite fields, Des. Codes Cryptogr., 74, 355, 10.1007/s10623-013-9865-9