A construction of optimal locally recoverable codes
From MaRDI portal
Publication:6107453
DOI10.1007/s12095-022-00619-xzbMath1530.94058arXiv2204.12034OpenAlexW4311625003MaRDI QIDQ6107453
Publication date: 3 July 2023
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2204.12034
Related Items (4)
New classes of NMDS codes with dimension 3 ⋮ Near MDS codes with dimension 4 and their application in locally recoverable codes ⋮ New infinite families of near MDS codes holding \(t\)-designs ⋮ Near-MDS codes from maximal arcs in \(\mathrm{PG}(2,q)\)
Cites Work
- Unnamed Item
- Weight distributions of cyclic codes with respect to pairwise coprime order elements
- Bent vectorial functions and linear codes from o-polynomials
- Difference sets and hyperovals
- Some quantum MDS codes with large minimum distance from generalized Reed-Solomon codes
- Minimal linear codes over finite fields
- MDS or NMDS self-dual codes from twisted generalized Reed-Solomon codes
- New quantum MDS codes with large minimum distance and short length from generalized Reed-Solomon codes
- Near MDS codes from oval polynomials
- A class of almost MDS codes
- On the Locality of Codeword Symbols
- Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes
- New LCD MDS Codes of Non-Reed-Solomon Type
- Designs from Linear Codes
- Infinite Families of Near MDS Codes Holding t-Designs
- An Infinite Family of Linear Codes Supporting 4-Designs
- On Two Classes of Primitive BCH Codes and Some Related Codes
This page was built for publication: A construction of optimal locally recoverable codes
