New bounds on the field size for maximally recoverable codes instantiating grid-like topologies
From MaRDI portal
Publication:2240731
DOI10.1007/s10801-021-01013-1OpenAlexW3129053442WikidataQ114226146 ScholiaQ114226146MaRDI QIDQ2240731
Gennian Ge, Jingxue Ma, Xiangliang Kong
Publication date: 4 November 2021
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1901.06915
distributed storage systemsmaximally recoverable codesgrid-like topologieshypergraph independent setpseudo-parity check matrix
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Bounds on codes (94B65) Other types of codes (94B60)
Cites Work
- Unnamed Item
- Unnamed Item
- A note on Ramsey numbers
- Extremal uncrowded hypergraphs
- Locality of optimal binary codes
- On the locality of codeword symbols in non-linear codes
- Optimal Locally Repairable Codes and Connections to Matroid Theory
- Binary Linear Locally Repairable Codes
- Bounds on the Size of Locally Recoverable Codes
- An Integer Programming-Based Bound for Locally Repairable Codes
- Repair Locality With Multiple Erasure Tolerance
- Explicit Maximally Recoverable Codes With Locality
- A Family of Optimal Locally Recoverable Codes
- On the Locality of Codeword Symbols
- Combinatorial Nullstellensatz
- Maximally Recoverable Codes for Grid-like Topologies
- On uncrowded hypergraphs
- Optimal Binary Linear Locally Repairable Codes with Disjoint Repair Groups
- The Independence Number of the Birkhoff Polytope Graph, and Applications to Maximally Recoverable Codes
- Maximally Recoverable LRCs: A field size lower bound and constructions for few heavy parities
- Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
- Locally Recoverable Codes on Algebraic Curves
- On Sequential Locally Repairable Codes
- On independent sets in hypergraphs
This page was built for publication: New bounds on the field size for maximally recoverable codes instantiating grid-like topologies
