Abstract
Replication was the easiest and most convenient method adopted for data storage systems however it increased the memory utilization as it made various duplicates or multiple copies of original data. Henceforth, erasure codes such as Reed-Solomon Codes were considered for the purpose of Data storage. RS Codes utilized Galois field operations which included Vandermonde Matrices and subsequently increased the decoding complexities making them more expensive for storage systems. In this paper, small sized Low Density Parity Check Code, for distributed storage architecture is proposed which uses only simple arithmetic XOR operations, and hence displays lower encoding and decoding complexities compared to its counterpart, Reed Solomon Codes. It is observed that reconstruction of the original information is possible even when there are node failures. LDPC Codes has been chosen for distributed data storage system as it does not require all of the data blocks in order to reconstruct the original file, making it an efficient coding scheme for storage systems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
