A new minimize matrix computation coding method for distributed storage systems

DOI10.1155/2019/4163780MaRDI QIDQ2298412zbMATH OpenOpenAlexWikidataFDO

Authors Chao Yin, Haitao Lv, Tongfang Li, Xiaoping Qu, Jianzong Wang, Guangyong Gao

Publication date 20 February 2020

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2019/4163780

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Distributed systems (68M14)

Recommendations

• Explicit constructions of MSR codes for clustered distributed storage: the rack-aware storage model
• Study of minimum bandwidth regeneration codes based on Cauchy matrix
• A new \((k+2,k)\) Hadamard minimum storage regenerating code
• Network Coding for Distributed Storage Systems
• A new piggybacking design for systematic MDS storage codes

Cites work

• A Family of Optimal Locally Recoverable Codes
• Network Coding for Distributed Storage Systems
• Polynomial Codes Over Certain Finite Fields
• X-code: MDS array codes with optimal encoding

Cited in

(1)

• scientific article; zbMATH DE number 3896211 (Why is no real title available?)

Describes a project that uses

Uses Software

• Hadoop
• Jerasure
• GitHub

This page was built for publication: A new minimize matrix computation coding method for distributed storage systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2298412)