Hull dimension of optimal binary LRCs with availability
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 6900653 (Why is no real title available?)
- A Family of Optimal Locally Recoverable Codes
- A new construction of linear codes with one-dimensional hull
- A new method for constructing linear codes with small hulls
- Affine and projective planes
- Binary linear complementary dual codes
- Binary optimal linear codes with various hull dimensions and entanglement-assisted QECCs
- Bounds and Constructions of Locally Repairable Codes: Parity-Check Matrix Approach
- Characterization and classification of binary linear codes with various hull dimensions from an improved mass formula
- Characterization and classification of optimal LCD codes
- Characterizations of the minimum weights of LCD codes of large dimensions
- Codes With Locality for Two Erasures
- Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes
- Constructions of Linear Codes With One-Dimensional Hull
- Constructions of good entanglement-assisted quantum error correcting codes
- Graph theory with applications
- Linear codes with complementary duals
- Linear codes with one-dimensional hull associated with Gaussian sums
- Linear codes with small hulls in semi-primitive case
- Locality and Availability in Distributed Storage
- On Linear Codes With One-Dimensional Euclidean Hull and Their Applications to EAQECCs
- On the Dimension of the Hull
- On the Hull-Variation Problem of Equivalent Linear Codes
- On the Locality of Codeword Symbols
- On the classification of linear complementary dual codes
- On the minimum weights of binary LCD codes and ternary LCD codes
- On the minimum weights of binary linear complementary dual codes
- Optimal Locally Repairable Codes and Connections to Matroid Theory
- Optimal binary LCD codes
- Optimal binary and ternary linear codes with hull dimension one
- Optimal binary linear locally repairable codes with disjoint repair groups
- Singleton-optimal LRCs and perfect LRCs via cyclic and constacyclic codes
- Some bounds on binary LCD codes
- Two classes of optimal LRCs with information (r, t)-locality
This page was built for publication: Hull dimension of optimal binary LRCs with availability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7229404)