Study of minimum bandwidth regeneration codes based on Cauchy matrix

DOI10.16339/J.CNKI.HDXBZKB.2017.08.023MaRDI QIDQ4640502zbMATH OpenFDO

Authors Hailong Song, Weiping Wang, Yalong Xiao

Publication date 25 May 2018

Full work available at URL https://doi.org/10.16339/J.CNKI.HDXBZKB.2017.08.023

zbMATH Keywords

Cauchy matrixdistributed storageerasure codesnetwork codingregeneration codesVandermonde matrix

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)

Recommendations

• Network Coding for Distributed Storage Systems
• Construction of minimum bandwidth regenerating codes with combinatorial design
• Editorial
• A new (k+2,k) Hadamard minimum storage regenerating code
• Repairing multiple failures for algebraic geometry codes

Cited in

(5)

• A new minimize matrix computation coding method for distributed storage systems
• A new (k+2,k) Hadamard minimum storage regenerating code
• Construction of minimum bandwidth regenerating codes with combinatorial design
• Repairing multiple failures for algebraic geometry codes
• Research on single node repair algorithm for multimedia cloud storage system based on network coding

This page was built for publication: Study of minimum bandwidth regeneration codes based on Cauchy matrix

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