Quasicyclic MDS codes for distributed storage with efficient exact repair

Author

Thangaraj, Andrew ; Sankar, Chinnadhurai

Author_Institution

Dept. of Electr. Eng., Indian Inst. of Technol. Madras, Chennai, India

fYear

2011

fDate

16-20 Oct. 2011

Firstpage

45

Lastpage

49

Abstract

In a distributed storage system, codes for efficient repair of failed nodes has attracted significant recent research attention. Ideas from network coding and interference alignment have been used successfully to show bounds and construct coding schemes for efficient repair. In this article, we use ideas from classical algebraic codes to interpret the requirements of efficient repair as existence of certain specific types of codewords in the dual code. Since the construction is quasicyclic and works over small fields, it appears to be a promising method for reducing the computational complexity of efficient repair codes.

Keywords

algebraic codes; computational complexity; cyclic codes; network coding; radiofrequency interference; algebraic codes; computational complexity; distributed storage system; efficient exact repair; failed nodes; interference alignment; network coding; quasicyclic MDS codes; Conferences; Fourier transforms; Information theory; Maintenance engineering; Polynomials; Vectors;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory Workshop (ITW), 2011 IEEE

Conference_Location

Paraty

Print_ISBN

978-1-4577-0438-3

Type

conf

DOI

10.1109/ITW.2011.6089502

Filename

6089502