Corpus ID: 219708416

Multilinear Algebra for Distributed Storage

@article{Duursma2020MultilinearAF,
  title={Multilinear Algebra for Distributed Storage},
  author={Iwan M. Duursma and Xiaoqin Li and Hsin-Po Wang},
  journal={ArXiv},
  year={2020},
  volume={abs/2006.08911}
}
  • Iwan M. Duursma, Xiaoqin Li, Hsin-Po Wang
  • Published 2020
  • Computer Science, Mathematics
  • ArXiv
  • An (n, k, d, α, β,M)-ERRC (exact-repair regenerating code) is a collection of n nodes used to store a file. For a file of total size M , each node stores α symbols, any k nodes recover the file, and any d nodes repair any other node via sending out β symbols. We establish a multilinear algebra foundation to assemble (n, k, d, α, β,M)-ERRCs for all meaningful (n, k, d) tuples. Our ERRCs tie the α/M -versus-β/M trade-off with cascade codes, the best known construction for this trade-off. We give… CONTINUE READING

    Figures, Tables, and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    Citations

    Publications citing this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 28 REFERENCES

    Existence and construction of capacity-achieving network codes for distributed storage

    • Yunnan Wu
    • Computer Science
    • 2009 IEEE International Symposium on Information Theory
    • 2009
    VIEW 2 EXCERPTS
    HIGHLY INFLUENTIAL

    Characterizing the Rate Region of the (4,3,3) Exact-Repair Regenerating Codes

    • Chao Tian
    • Computer Science, Mathematics
    • IEEE Journal on Selected Areas in Communications
    • 2014

    Cooperative Regenerating Codes

    Cooperative Repair: Constructions of Optimal MDS Codes for All Admissible Parameters

    Determinant Codes With Helper-Independent Repair for Single and Multiple Failures

    Determinant Coding: A Novel Framework for Exact-Repair Regenerating Codes