Locally repairable codes with multiple repair sets based on packings of block size 4
Tóm tắt
Từ khóa
Tài liệu tham khảo
Gopalan, P., Huang, C., Simitci, H., Yekhanin, S.: On the locality of codeword symbols. IEEE Trans. Inf. Theory 58(11), 6925–6934 (2012)
Huang, C., Chen, M., Li, J.: Pyramid codes: Flexible schemes to trade space for access efficiency in reliable data storage systems. In: 6th IEEE International Symposium on Network Computing and Applications (NCA 2007), pp. 79–86 (2007). https://doi.org/10.1109/NCA.2007.37
Huang, C., Simitci, H., Xu, Y., Ogus, A., Calder, B., Gopalan, P., Li, J., Yekhanin, S.: Erasure coding in windows azure storage. In: Presented as part of the 2012 {USENIX} annual technical conference ({USENIX}{ATC} 12), pp. 15–26 (2012)
Prakash, N., Kamath, G.M., Lalitha, V., Kumar, P.V.: Optimal linear codes with a local-error-correction property. In: 2012 IEEE International symposium on information theory proceedings, pp. 2776–2780 (2012). IEEE
Wang, A., Zhang, Z.: Repair locality with multiple erasure tolerance. IEEE Trans. Inf. Theory 60(11), 6979–6987 (2014)
Cai, H., Cheng, M., Fan, C., Tang, X.: Optimal locally repairable systematic codes based on packings. IEEE Trans. Commun. 67(1), 39–49 (2018)
Cai, H., Miao, Y., Schwartz, M., Tang, X.: On optimal locally repairable codes with multiple disjoint repair sets. IEEE Trans. Inf. Theory 66(4), 2402–2416 (2019)
Rawat, A.S., Papailiopoulos, D.S., Dimakis, A.G., Vishwanath, S.: Locality and availability in distributed storage. IEEE Trans. Inf. Theory 62(8), 4481–4493 (2016)
Huang, C., Chen, M., Li, J.: Pyramid codes: Flexible schemes to trade space for access efficiency in reliable data storage systems. ACM Transactions on Storage (TOS) 9(1), 1–28 (2013)
Rawat, A.S., Koyluoglu, O.O., Silberstein, N., Vishwanath, S.: Optimal locally repairable and secure codes for distributed storage systems. IEEE Trans. Inf. Theory 60(1), 212–236 (2013)
Guruswami, V., Xing, C., Yuan, C.: How long can optimal locally repairable codes be? IEEE Trans. Inf. Theory 65(6), 3662–3670 (2019)
Tamo, I., Barg, A.: A family of optimal locally recoverable codes. IEEE Trans. Inf. Theory 60(8), 4661–4676 (2014)
Cai, H., Schwartz, M.: On optimal locally repairable codes and generalized sector-disk codes. IEEE Trans. Inf. Theory 67(2), 686–704 (2020)
Cai, H., Miao, Y., Schwartz, M., Tang, X.: A construction of maximally recoverable codes with order-optimal field size. IEEE Trans. Inf. Theory 68(1), 204–212 (2021)
Tan, P., Zhou, Z., Sidorenko, V., Parampalli, U.: Two classes of optimal lrcs with information (r, t)-locality. Des. Codes Crypt. 88(9), 1741–1757 (2020)
Song, W., Dau, S.H., Yuen, C., Li, T.J.: Optimal locally repairable linear codes. IEEE J Sel. Areas Commun. 32(5), 1019–1036 (2014)
Westerbäck, T., Freij-Hollanti, R., Ernvall, T., Hollanti, C.: On the combinatorics of locally repairable codes via matroid theory. IEEE Trans. Inf. Theory 62(10), 5296–5315 (2016)
Chen, B., Xia, S.-T., Hao, J., Fu, F.-W.: Constructions of optimal cyclic $$(r,{\delta })$$ locally repairable codes. IEEE Trans. Inf. Theory 64(4), 2499–2511 (2017)
Martínez-Peñas, U., Kschischang, F.R.: Universal and dynamic locally repairable codes with maximal recoverability via sum-rank codes. IEEE Trans. Inf. Theory 65(12), 7790–7805 (2019)
Tamo, I., Barg, A., Frolov, A.: Bounds on the parameters of locally recoverable codes. IEEE Trans. Inf. Theory 62(6), 3070–3083 (2016)
Su, Y.-S.: On the construction of local parities for $$(r, t) $$-availability in distributed storage. IEEE Trans. Commun. 65(6), 2332–2344 (2017)
Hao, J., Xia, S.-T.: Constructions of optimal binary locally repairable codes with multiple repair groups. IEEE Commun. Lett. 20(6), 1060–1063 (2016)
Tang, D., Liu, J., Mesnager, S.: On constructions of binary locally repairable codes with locality two and multiple repair alternatives via autocorrelation spectra of boolean functions. In: The Twelfth International Workshop on Coding and Cryptography (WCC) (2022)
Jiang, J., Cheng, M.: Regular (k, r, 1)-packings with max (r)= 3 and their locally repairable codes. Crypt. Commun. 12(6), 1071–1089 (2020)
Colbourn, C.J., Dinitz, J.H.: Handbook of combinatorial designs, 2nd Edn (Discrete Mathematics and Its Applications). Chapman & Hall/CRC, (2007)
Ge, G., Lam, C.W., Ling, A.C., Shen, H.: Resolvable maximum packings with quadruples. Des. Codes Crypt. 35, 287–302 (2005)
Chung, F.R., Salehi, J.A., Wei, V.K.: Optical orthogonal codes: design, analysis and applications. IEEE Trans. Inf. Theory 35(3), 595–604 (1989)
Chung, H., Kumar, P.V.: Optical orthogonal codes-new bounds and an optimal construction. IEEE Trans. Inf. Theory 36(4), 866–873 (1990)
Moreno, O., Omrani, R., Kumar, P.V., Lu, H.-F.: A generalized bose-chowla family of optical orthogonal codes and distinct difference sets. IEEE Trans. Inf. Theory 53(5), 1907–1910 (2007)