The following pages link to Locality of optimal binary codes (Q2406696):
Displaying 19 items.
- Edge local complementation and equivalence of binary linear codes (Q1009082) (← links)
- Coding for locality in reconstructing permutations (Q1696052) (← links)
- Anticode-based locally repairable codes with high availability (Q1696053) (← links)
- Liar's dominating set in unit disk graphs (Q1791011) (← links)
- Infinite families of optimal linear codes and their applications to distributed storage systems (Q2103140) (← links)
- Application of optimal \(p\)-ary linear codes to alphabet-optimal locally repairable codes (Q2132450) (← links)
- The complete hierarchical locality of the punctured simplex code (Q2220763) (← links)
- An infinite family of Griesmer quasi-cyclic self-orthogonal codes (Q2238928) (← links)
- New bounds on the field size for maximally recoverable codes instantiating grid-like topologies (Q2240731) (← links)
- On binary locally repairable codes with distance four (Q2662041) (← links)
- The minimum locality of linear codes (Q2678979) (← links)
- A survey on locally repairable codes (Q3381470) (← links)
- (Q4209048) (← links)
- Local asymptotic coding and the minimum description length (Q4701387) (← links)
- Optimal Binary Linear Locally Repairable Codes with Disjoint Repair Groups (Q5206236) (← links)
- Locality and Availability of Array Codes Constructed From Subspaces (Q5223958) (← links)
- Explicit Construction of Optimal Locally Recoverable Codes of Distance 5 and 6 via Binary Constant Weight Codes (Q5224101) (← links)
- A characterization of optimal locally repairable codes (Q6041876) (← links)
- On locality of binary distance-optimal codes (Q6542653) (← links)
