Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

The (r, δ)-Locality of Repeated-Root Cyclic Codes with Prime Power Lengths (2304.00762v2)

Published 3 Apr 2023 in cs.IT and math.IT

Abstract: Locally repairable codes (LRCs) are designed for distributed storage systems to reduce the repair bandwidth and disk I/O complexity during the storage node repair process. A code with $(r,\delta)$-locality (also called an $(r,\delta)$-LRC) can simultaneously repair up to $\delta-1$ symbols in a codeword by accessing at most $r$ other symbols in the codeword. In this paper, we propose a new method to calculate the $(r,\delta)$-locality of cyclic codes. Initially, we give a description of the algebraic structure of repeated-root cyclic codes of prime power lengths. Using this result, we derive a formula of $(r,\delta)$-locality of these cyclic codes for a wide range of $\delta$ values. Furthermore, we calculate the parameters of repeated-root cyclic codes of prime power lengths and obtain several infinite families of optimal cyclic $(r,\delta)$-LRCs, which exhibit new parameters compared with existing research on optimal $(r,\delta)$-LRCs with a cyclic structure. For the specific case of $\delta=2$, we have comprehensively identified all potential optimal cyclic $(r,2)$-LRCs of prime power lengths.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (46)
  1. A. G. Dimakis, P. B. Godfrey, Y. Wu, M. J. Wainwright, and K. Ramchandran, “Network coding for distributed storage systems,” IEEE Trans. on Inf. Theory, vol. 56, no. 9, pp. 4539–4551, 2010.
  2. P. Gopalan, C. Huang, H. Simitci, and S. Yekhanin, “On the locality of codeword symbols,” IEEE Trans. on Inf. Theory, vol. 58, no. 11, pp. 6925–6934, Nov. 2012.
  3. F. Oggier and A. Datta, “Self-repairing homomorphic codes for distributed storage systems,” in 2011 IEEE Infocom.   IEEE, 2011, pp. 1215–1223.
  4. H. Cheng, M. Chen, and L. Jin, “Pyramid codes: Flexible schemes to trade space for access efficiency in reliable data storage systems,” in IEEE International Symposium on Network Computing &\&& Applications.   IEEE, 2007, pp. 79–86.
  5. A. Barg, I. Tamo, and S. Vlăduţ, “Locally recoverable codes on algebraic curves,” IEEE Trans. on Inf. Theory, vol. 63, no. 8, pp. 4928–4939, 2017.
  6. J. Han and L. A. Lastras-Montano, “Reliable memories with subline accesses,” in IEEE Int. Symp. on Inf. Theory.   IEEE, 2007, pp. 2531–2535.
  7. I. Tamo, D. S. Papailiopoulos, and A. G. Dimakis, “Optimal locally repairable codes and connections to matroid theory,” IEEE Transactions on Information Theory, vol. 62, no. 12, pp. 6661–6671, 2016.
  8. V. R. Cadambe and A. Mazumdar, “Bounds on the size of locally recoverable codes,” IEEE Trans. on Inf. Theory, vol. 61, no. 11, pp. 5787–5794, 2015.
  9. B. Chen, W. Fang, S.-T. Xia, and F.-W. Fu, “Constructions of optimal (r,δ)𝑟𝛿(r,\delta)( italic_r , italic_δ ) locally repairable codes via constacyclic codes,” IEEE Trans. on Communications, vol. 67, no. 8, pp. 5253–5263, 2019.
  10. B. Chen, W. Fang, S.-T. Xia, J. Hao, and F.-W. Fu, “Improved bounds and singleton-optimal constructions of locally repairable codes with minimum distance 5 and 6,” IEEE Trans. on Inf. Theory, vol. 67, no. 1, pp. 217–231, 2020.
  11. W. Fang, B. Chen, S.-T. Xia, and F.-W. Fu, “Complete characterization of optimal LRCs with minimum distance 6 and locality 2: Improved bounds and constructions,” in IEEE Int. Symp. on Inf. Theory.   IEEE, 2020, pp. 595–599.
  12. M. Forbes and S. Yekhanin, “On the locality of codeword symbols in non-linear codes,” Discrete mathematics, vol. 324, pp. 78–84, 2014.
  13. J. Hao, S.-T. Xia, K. W. Shum, B. Chen, F.-W. Fu, and Y. Yang, “Bounds and constructions of locally repairable codes: Parity-check matrix approach,” IEEE Trans. on Inf. Theory, vol. 66, no. 12, pp. 7465–7474, 2020.
  14. X. Li, L. Ma, and C. Xing, “Optimal locally repairable codes via elliptic curves,” IEEE Trans. on Inf. Theory, vol. 65, no. 1, pp. 108–117, 2018.
  15. I. Tamo, A. Barg, and A. Frolov, “Bounds on the parameters of locally recoverable codes,” IEEE Trans. on Inf. Theory, vol. 62, no. 6, pp. 3070–3083, 2016.
  16. I. Tamo and A. Barg, “A family of optimal locally recoverable codes,” IEEE Transactions on Information Theory, vol. 60, no. 8, pp. 4661–4676, 2014.
  17. I. Tamo, A. Barg, S. Goparaju, and R. Calderbank, “Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes,” International Journal of Information and Coding Theory, vol. 3, no. 4, pp. 345–364, 2016.
  18. J. Hao, S.-T. Xia, and B. Chen, “On optimal ternary locally repairable codes,” in IEEE Int. Symp. on Inf. Theory.   IEEE, 2017, pp. 171–175.
  19. A. Wang and Z. Zhang, “An integer programming-based bound for locally repairable codes,” IEEE Trans. on Inf. Theory, vol. 61, no. 10, pp. 5280–5294, 2015.
  20. A. S. Rawat, D. S. Papailiopoulos, A. G. Dimakis, and S. Vishwanath, “Locality and availability in distributed storage,” IEEE Trans. on Inf. Theory, vol. 62, no. 8, pp. 4481–4493, 2016.
  21. A. Wang and Z. Zhang, “Repair locality with multiple erasure tolerance,” IEEE Trans. on Inf. Theory, vol. 60, no. 11, pp. 6979–6987, 2014.
  22. A. Wang, Z. Zhang, and D. Lin, “Two classes of (r, t)-locally repairable codes,” in IEEE Int. Symp. on Inf. Theory.   IEEE, 2016, pp. 445–449.
  23. A. Wang, Z. Zhang, and M. Liu, “Achieving arbitrary locality and availability in binary codes,” in IEEE Int. Symp. on Inf. Theory.   IEEE, 2015, pp. 1866–1870.
  24. N. Prakash, G. M. Kamath, V. Lalitha, and P. V. Kumar, “Optimal linear codes with a local-error-correction property,” in IEEE Int. Symp. on Inf. Theory.   IEEE, Jul. 2012.
  25. L. Jin, “Explicit construction of optimal locally recoverable codes of distance 5 and 6 via binary constant weight codes,” IEEE Trans. on Inf. Theory, vol. 65, no. 8, pp. 4658–4663, 2019.
  26. L. Jin, L. Ma, and C. Xing, “Construction of optimal locally repairable codes via automorphism groups of rational function fields,” IEEE Trans. on Inf. Theory, vol. 66, no. 1, pp. 210–221, 2019.
  27. Y. Luo, C. Xing, and C. Yuan, “Optimal locally repairable codes of distance 3 and 4 via cyclic codes,” IEEE Trans. on Inf. Theory, vol. 65, no. 2, pp. 1048–1053, 2019.
  28. H. Cai, Y. Miao, M. Schwartz, and X. Tang, “On optimal locally repairable codes with super-linear length,” IEEE Trans. on Inf. Theory, vol. 66, no. 8, pp. 4853–4868, 2020.
  29. B. Chen, S.-T. Xia, J. Hao, and F.-W. Fu, “Constructions of optimal cyclic (r,δ)𝑟𝛿(r,\delta)( italic_r , italic_δ ) locally repairable codes,” IEEE Trans. on Inf. Theory, vol. 64, no. 4, pp. 2499–2511, 2017.
  30. G. Zhang and H. Liu, “Constructions of optimal codes with hierarchical locality,” IEEE Trans. on Inf. Theory, vol. 66, no. 12, pp. 7333–7340, 2020.
  31. X. Kong, X. Wang, and G. Ge, “New constructions of optimal locally repairable codes with super-linear length,” IEEE Trans. on Inf. Theory, vol. 67, no. 10, pp. 6491–6506, 2021.
  32. Z. Sun, S. Zhu, and L. Wang, “Optimal constacyclic locally repairable codes,” IEEE Communications Letters, vol. 23, no. 2, pp. 206–209, 2018.
  33. W. Fang and F.-W. Fu, “Optimal cyclic (r,δ)𝑟𝛿(r,\delta)( italic_r , italic_δ ) locally repairable codes with unbounded length,” Finite Fields and Their Applications, vol. 63, pp. 1–14, 2020.
  34. F. Tian and S. Zhu, “Optimal cyclic locally repairable codes with unbounded length from their zeros,” Discrete Mathematics, vol. 345, no. 9, 2022.
  35. G. Luo, M. F. Ezerman, and S. Ling, “Three new constructions of optimal locally repairable codes from matrix-product codes,” IEEE Trans. on Inf. Theory, vol. 69, no. 1, pp. 75–85, 2023.
  36. G. Castagnoli, J. L. Massey, P. A. Schoeller, and N. Von Seemann, “On repeated-root cyclic codes,” IEEE Transactions on Information Theory, vol. 37, no. 2, pp. 337–342, 1991.
  37. H. Q. Dinh, B. T. Nguyen, A. K. Singh, and S. Sriboonchitta, “On the symbol-pair distance of repeated-root constacyclic codes of prime power lengths,” IEEE Transactions on Information Theory, vol. 64, no. 4, pp. 2417–2430, 2017.
  38. H. Q. Dinh, “Constacyclic codes of length pssuperscript𝑝𝑠p^{s}italic_p start_POSTSUPERSCRIPT italic_s end_POSTSUPERSCRIPT over 𝔽pm+u⁢𝔽pmsuperscriptsubscript𝔽𝑝𝑚𝑢superscriptsubscript𝔽𝑝𝑚\mathbb{F}_{p}^{m}+u\mathbb{F}_{p}^{m}blackboard_F start_POSTSUBSCRIPT italic_p end_POSTSUBSCRIPT start_POSTSUPERSCRIPT italic_m end_POSTSUPERSCRIPT + italic_u blackboard_F start_POSTSUBSCRIPT italic_p end_POSTSUBSCRIPT start_POSTSUPERSCRIPT italic_m end_POSTSUPERSCRIPT,” Journal of Algebra, vol. 324, no. 5, pp. 940–950, 2010.
  39. R. Sobhani, “Matrix-product structure of repeated-root cyclic codes over finite fields,” Finite Fields and Their Applications, vol. 39, pp. 216–232, 2016.
  40. J. L. Massey, D. J. Costello, and J. Justesen, “Polynomial weights and code constructions,” IEEE Trans. on Inf. Theory, vol. 19, no. 1, pp. 101–110, Jan. 1973.
  41. H. Q. Dinh, “On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions,” Finite Fields and Their Applications, vol. 14, no. 1, pp. 22–40, 2008. [Online]. Available: https://www.sciencedirect.com/science/article/pii/S1071579707000433
  42. T. Blackmore and G. H. Norton, “Matrix-product codes over 𝔽qsubscript𝔽𝑞\mathbb{F}_{q}blackboard_F start_POSTSUBSCRIPT italic_q end_POSTSUBSCRIPT,” Applicable Algebra in Engineering, Communication and Computing, vol. 12, no. 6, pp. 477–500, 2001.
  43. W. Zhao, K. W. Shum, and S. Yang, “Optimal locally repairable constacyclic codes of prime power lengths,” in IEEE Int. Symp. on Inf. Theory.   IEEE, Jun. 2020.
  44. R. Zengin and M. E. Köroǧlu, “Constacyclic locally recoverable codes from their duals,” Computational and Applied Mathematics, vol. 43, no. 4, p. 182, 2024.
  45. H. Chen, J. Weng, W. Luo, and L. Xu, “Long optimal and small-defect lrc codes with unbounded minimum distances,” IEEE Transactions on Information Theory, vol. 67, no. 5, pp. 2786–2792, 2021.
  46. V. Guruswami, C. Xing, and C. Yuan, “How long can optimal locally repairable codes be?” IEEE Trans. on Inf. Theory, vol. 65, no. 6, pp. 3662–3670, 2019.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets