Infinite families of optimal linear codes and their applications to distributed storage systems
From MaRDI portal
Publication:2103140
Recommendations
- Application of optimal \(p\)-ary linear codes to alphabet-optimal locally repairable codes
- A family of distance-optimal minimal linear codes with flexible parameters
- The minimum locality of linear codes
- Locality of optimal binary codes
- Optimal binary linear locally repairable codes with disjoint repair groups
Cites work
- scientific article; zbMATH DE number 3871188 (Why is no real title available?)
- A coding theory construction of new systematic authentication codes
- A construction of codes with linearity from two linear codes
- A new class of optimal linear codes with flexible parameters
- Anticode-based locally repairable codes with high availability
- Bounds and Constructions of Locally Repairable Codes: Parity-Check Matrix Approach
- Complete weight enumerators of some cyclic codes
- Cyclotomic Linear Codes of Order $3$
- Few-weight codes from trace codes over a local ring
- Fundamentals of Error-Correcting Codes
- Hamming Weights of the Duals of Cyclic Codes With Two Zeros
- Linear Codes With Two or Three Weights From Weakly Regular Bent Functions
- Linear codes with two or three weights from quadratic bent functions
- New binary linear codes which are dual transforms of good codes
- On the Locality of Codeword Symbols
- Optimal binary codes from trace codes over a non-chain ring
- Secret sharing schemes from three classes of linear codes
- The Geometry of Two-Weight Codes
- Two New Families of Two-Weight Codes
- Two and three weight codes over \(\mathbb {F}_p+u\mathbb {F}_p\)
- Two or Few-Weight Trace Codes over ${\mathbb{F}_{q}}+u{\mathbb{F}_{q}}$
- Two-Weight Codes Punctured from Irreducible Cyclic Codes
Cited in
(4)
This page was built for publication: Infinite families of optimal linear codes and their applications to distributed storage systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2103140)
