The minimum locality of linear codes
From MaRDI portal
Recommendations
- The parameters of minimal linear codes
- Locality of optimal binary codes
- On the minimum length of some linear codes
- scientific article; zbMATH DE number 2143618
- On minimal and quasi-minimal linear codes
- A class of minimum linear codes and their applications
- Hardness of approximating the minimum distance of a linear code
- Minimal vectors in linear codes
- On the minimum bit-error rate of linear codes
- Minimum distance of linear codes and the -invariant
Cites work
- scientific article; zbMATH DE number 1284429 (Why is no real title available?)
- scientific article; zbMATH DE number 7561591 (Why is no real title available?)
- A Family of Optimal Locally Recoverable Codes
- Almost MDS codes
- An Infinite Family of Linear Codes Supporting 4-Designs
- Binary Linear Locally Repairable Codes
- Bounds on the size of locally recoverable codes
- Codes of small defect
- Codes, Differentially $\delta$ -Uniform Functions, and $t$ -Designs
- Constructions of Locally Recoverable Codes Which are Optimal
- Constructions of Locally Repairable Codes With Multiple Recovering Sets via Rational Function Fields
- Constructions of optimal locally recoverable codes via Dickson polynomials
- Designs from linear codes
- Difference sets and hyperovals
- Elliptic near-MDS codes over \(\mathbb{F}_5\)
- Fundamentals of Error-Correcting Codes
- Infinite Families of Near MDS Codes Holding t-Designs
- NMDS codes of maximal length over F/sub q/,8≤q≤11
- Near MDS codes from oval polynomials
- Near-MDS codes arising from algebraic curves
- Near-MDS codes over some small fields
- New 5-designs
- New affine-invariant codes from lifting
- On near-MDS codes
- On the Locality of Codeword Symbols
- On the extendibility of near-MDS elliptic codes
- Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes
- Optimal Locally Repairable Codes: An Improved Bound and Constructions
- Quasi-cyclic NMDS codes
- Self-Dual Near MDS Codes from Elliptic Curves
- Shortened Linear Codes Over Finite Fields
- The Subfield Codes of Ovoid Codes
- The complete hierarchical locality of the punctured simplex code
- Two classes of optimal LRCs with information (r, t)-locality
Cited in
(31)- Constructions of near MDS codes which are optimal locally recoverable codes
- Infinite families of optimal linear codes and their applications to distributed storage systems
- A family of self-orthogonal divisible codes with locality 2
- Local asymptotic coding and the minimum description length
- New infinite families of near MDS codes holding \(t\)-designs
- Two families of optimal quantum locally recoverable codes
- Application of optimal \(p\)-ary linear codes to alphabet-optimal locally repairable codes
- On binary matroid minors and applications to data storage over small fields
- Edge local complementation and equivalence of binary linear codes
- 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
- Near-MDS codes from maximal arcs in \(\mathrm{PG}(2,q)\)
- Four new families of NMDS codes with dimension 4 and their applications
- Some new constructions of optimal linear codes and alphabet-optimal \((r, \delta)\)-locally repairable codes
- Some constacyclic BCH codes with good parameters
- Locality and Availability of Array Codes Constructed From Subspaces
- Optimal RS-like LRC codes of arbitrary length
- A class of locally recoverable codes over finite chain rings
- On the locality of codeword symbols in non-linear codes
- On finding the largest minimum distance of locally recoverable codes: a graph theory approach
- Computing sharp recovery structures for locally recoverable codes
- A family of codes with variable locality and availability
- Locality of optimal binary codes
- Optimal \((2, \delta)\) locally repairable codes via punctured simplex codes
- Codes With Locality in the Rank and Subspace Metrics
- Introducing locality in some generalized AG codes
- Multiple repair localities with distinct erasure tolerance
- Bounds on the size of locally recoverable codes
- Minimum distance and parameter ranges of locally recoverable codes with availability from fiber products of curves
- Maximally recoverable LRCs: a field size lower bound and constructions for few heavy parities
- Obtaining new classes of optimal linear codes by puncturing and shortening optimal cyclic codes
This page was built for publication: The minimum locality of linear codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2678979)
