Distributed Storage Systems based on Equidistant Subspace Codes
arXiv:1406.6170
Abstract
Distributed storage systems based on equidistant constant dimension codes are presented. These equidistant codes are based on the Plücker embedding, which is essential in the repair and the reconstruction algorithms. These systems posses several useful properties such as high failure resilience, minimum bandwidth, low storage, simple algebraic repair and reconstruction algorithms, good locality, and compatibility with small fields.
References in corpus (5)
- Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions
- Optimal Locally Repairable Codes via Rank-Metric Codes
- Self-Repairing Codes for Distributed Storage - A Projective Geometric Construction
- Storage codes -- coding rate and repair locality
- Equidistant Codes in the Grassmannian