An optimal binary linear functional-repair storage code with efficient repair related to PG(2,8)
From MaRDI portal
Publication:6892140
Cites work
- A survey of the different types of vector space partitions
- Centralized Multi-Node Repair Regenerating Codes
- Codes for Distributed Storage
- Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth Tradeoff
- Functional repair codes: a view from projective geometry
- scientific article; zbMATH DE number 52497 (Why is no real title available?)
- scientific article; zbMATH DE number 53569 (Why is no real title available?)
- scientific article; zbMATH DE number 1250549 (Why is no real title available?)
- scientific article; zbMATH DE number 1101474 (Why is no real title available?)
- scientific article; zbMATH DE number 2065945 (Why is no real title available?)
- Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions
- Linear representations of projective planes in projective spaces
- Network Coding for Distributed Storage Systems
- Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
- Partitions of finite vector spaces: an application of the Frobenius number in geometry
- Polynomial Time Algorithms for Multicast Network Code Construction
- The algebraic and geometric theory of quadratic forms
This page was built for publication: An optimal binary linear functional-repair storage code with efficient repair related to \(\mathrm{PG}(2,8)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6892140)