Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions
Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions
Regenerating codes are a class of recently developed codes for distributed storage that, like Reed-Solomon codes, permit data recovery from any arbitrary <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex Notation="TeX">$k$</tex> </formula> of <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex Notation="TeX">$n$</tex> </formula> nodes. However regenerating codes possess in addition, the ability to repair a failed node by …