2000 character limit reached
A class of locally recoverable codes over finite chain rings
Published 10 Jan 2024 in cs.IT, math.AC, and math.IT | (2401.05286v1)
Abstract: Locally recoverable codes deal with the task of reconstructing a lost symbol by relying on a portion of the remaining coordinates smaller than an information set. We consider the case of codes over finite chain rings, generalizing known results and bounds for codes over fields. In particular, we propose a new family of locally recoverable codes by extending a construction proposed in 2014 by Tamo and Barg, and we discuss its optimality.
- Marc André Armand. List decoding of generalized Reed-Solomon codes over commutative rings. IEEE transactions on information theory, 51(1):411–419, 2005.
- Locally recoverable codes from algebraic curves and surfaces. In Algebraic Geometry for Coding Theory and Cryptography: IPAM, Los Angeles, CA, February 2016, pages 95–127. Springer, 2017.
- Bounds on the size of locally recoverable codes. IEEE Transactions on Information Theory, 61(11):5787–5794, 2015.
- On the locality of codeword symbols in non-linear codes. Discrete Mathematics, 324:78–84, 2014.
- On the locality of codeword symbols. IEEE Transactions on Information theory, 58(11):6925–6934, 2012.
- Binary cyclic codes that are locally repairable. In 2014 IEEE International Symposium on Information Theory, pages 676–680. IEEE, 2014.
- How long can optimal locally repairable codes be? IEEE Transactions on Information Theory, 65(6):3662–3670, 2019.
- Lingfei Jin. Explicit construction of optimal locally recoverable codes of distance 5 and 6 via binary constant weight codes. IEEE Transactions on Information Theory, 65(8):4658–4663, 2019.
- Construction of optimal locally repairable codes via automorphism groups of rational function fields. IEEE Transactions on Information Theory, 66(1):210–221, 2019.
- Codes with local regeneration and erasure correction. IEEE Transactions on information theory, 60(8):4637–4660, 2014.
- New constructions of optimal locally recoverable codes via good polynomials. IEEE Transactions on Information Theory, 64(2):889–899, 2017.
- Florence Jessie MacWilliams and Neil James Alexander Sloane. The theory of error correcting codes, volume 16. Elsevier, 1977.
- Bernard R McDonald. Finite rings with identity, volume 28. Marcel Dekker Incorporated, 1974.
- Giacomo Micheli. Constructions of locally recoverable codes which are optimal. IEEE transactions on information theory, 66(1):167–175, 2019.
- G.H. Norton and A. Salagean. On the hamming distance of linear codes over a finite chain ring. IEEE Transactions on Information Theory, 46(3):1060–1067, 2000.
- On the structure of linear and cyclic codes over a finite chain ring. Applicable algebra in engineering, communication and computing, 10:489–506, 2000.
- Young Ho Park. Modular independence and generator matrices for codes over ℤmsubscriptℤ𝑚\mathbb{Z}_{m}blackboard_Z start_POSTSUBSCRIPT italic_m end_POSTSUBSCRIPT. Designs, codes and Cryptography, 50(2):147–162, 2009.
- On generalized Reed–Solomon codes over commutative and noncommutative rings. IEEE transactions on information theory, 59(9):5882–5897, 2013.
- Locality and availability in distributed storage. IEEE Transactions on Information Theory, 62(8):4481–4493, 2016.
- A family of optimal locally recoverable codes. IEEE Transactions on Information Theory, 60(8):4661–4676, 2014.
- Construction of optimal locally recoverable codes and connection with hypergraph. arXiv preprint arXiv:1811.09142, 2018.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
