The minimum locality of linear codes
From MaRDI portal
Publication:2678979
DOI10.1007/s10623-022-01099-zOpenAlexW4292937362WikidataQ114226816 ScholiaQ114226816MaRDI QIDQ2678979
Cunsheng Ding, Pan Tan, Zhengchun Zhou, Chun-Ming Tang, Cui Ling Fan
Publication date: 18 January 2023
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-022-01099-z
Combinatorial aspects of block designs (05B05) Linear codes (general theory) (94B05) Cyclic codes (94B15) Combinatorial codes (94B25)
Related Items
Near MDS codes of non-elliptic-curve type from Reed-Solomon codes, 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)\), Constructions of near MDS codes which are optimal locally recoverable codes
Cites Work
- Unnamed Item
- Unnamed Item
- Codes of small defect
- Almost MDS codes
- Elliptic near-MDS codes over \(\mathbb{F}_5\)
- Difference sets and hyperovals
- On the extendibility of near-MDS elliptic codes
- On near-MDS codes
- Near-MDS codes over some small fields
- Two classes of optimal LRCs with information \((r, t)\)-locality
- Constructions of optimal locally recoverable codes via Dickson polynomials
- The complete hierarchical locality of the punctured simplex code
- Quasi-cyclic NMDS codes
- Near-MDS codes arising from algebraic curves
- Near MDS codes from oval polynomials
- Binary Linear Locally Repairable Codes
- Bounds on the Size of Locally Recoverable Codes
- A Family of Optimal Locally Recoverable Codes
- New affine-invariant codes from lifting
- On the Locality of Codeword Symbols
- Fundamentals of Error-Correcting Codes
- Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes
- NMDS codes of maximal length over F/sub q/,8≤q≤11
- Shortened Linear Codes Over Finite Fields
- Designs from Linear Codes
- Optimal Locally Repairable Codes: An Improved Bound and Constructions
- Codes, Differentially $\delta$ -Uniform Functions, and $t$ -Designs
- Infinite Families of Near MDS Codes Holding t-Designs
- An Infinite Family of Linear Codes Supporting 4-Designs
- Constructions of Locally Recoverable Codes Which are Optimal
- Constructions of Locally Repairable Codes With Multiple Recovering Sets via Rational Function Fields
- Self-Dual Near MDS Codes from Elliptic Curves
- The Subfield Codes of Ovoid Codes
- New 5-designs
