[Paper Review] On Partial Maximally-Recoverable and Maximally-Recoverable Codes

S. B. Balaji, P. Vijay Kumar|arXiv (Cornell University)|Jan 28, 2015

Advanced Data Storage Technologies11 references4 citations

TL;DR

This paper introduces partially maximally recoverable (PMR) codes as a relaxation of maximally recoverable (MR) codes, enabling high-rate constructions with significantly reduced field size. It presents a simple construction for high-rate PMR codes and proposes a general framework for further exploration, while also offering three improved constructions for MR codes with smaller finite field sizes, achieving field size O(n^{Δ−1}) for fixed r and Δ.

ABSTRACT

An [n, k] linear code C that is subject to locality constraints imposed by a parity check matrix H0 is said to be a maximally recoverable (MR) code if it can recover from any erasure pattern that some k-dimensional subcode of the null space of H0 can recover from. The focus in this paper is on MR codes constrained to have all-symbol locality r. Given that it is challenging to construct MR codes having small field size, we present results in two directions. In the first, we relax the MR constraint and require only that apart from the requirement of being an optimum all-symbol locality code, the code must yield an MDS code when punctured in a single, specific pattern which ensures that each local code is punctured in precisely one coordinate and that no two local codes share the same punctured coordinate. We term these codes as partially maximally recoverable (PMR) codes. We provide a simple construction for high-rate PMR codes and then provide a general, promising approach that needs further investigation. In the second direction, we present three constructions of MR codes with improved parameters, primarily the size of the finite field employed in the construction

Motivation & Objective

• To address the challenge of constructing maximally recoverable (MR) codes with small finite field sizes in distributed storage systems.
• To relax the strict MR constraint by introducing partially maximally recoverable (PMR) codes that maintain optimal all-symbol locality and MDS puncturing properties.
• To develop new constructions of MR codes with improved field size parameters, especially for high-rate scenarios.
• To provide a general, non-explicit construction for MR codes with field size O(n^{Δ−1}) using polynomial constraints on parity-check matrices.
• To explore alternative constructions via modified parity-check matrices and algebraic structures for better field size efficiency.

Proposed method

• Proposes PMR codes that are optimal all-symbol locality codes and yield MDS codes when punctured in a specific single-pattern, ensuring each local code is punctured in one unique coordinate.
• Uses a construction based on evaluation of polynomials over finite fields, where monomials avoid exponents congruent to r mod (r+1), ensuring locality properties.
• Applies puncturing to a code derived from a subcode of a Reed-Solomon code grouped into cosets of size r+1, preserving locality and enabling MR properties.
• Modifies the parity-check matrix construction from [15] by redefining field element assignments to reduce field size while maintaining MR properties.
• Employs a canonical form of the parity-check matrix with a fixed MDS submatrix and variable local parity blocks, proving existence of field assignments that yield MR codes.
• Establishes existence of MR codes with field size O(n^{Δ−1}) by ensuring polynomial constraints on matrix entries satisfy required rank conditions.

Experimental results

Research questions

• RQ1 Can we construct high-rate codes with all-symbol locality r that are maximally recoverable under a relaxed condition, rather than full MR constraints?
• RQ2 What is the minimal finite field size required to construct MR codes with all-symbol locality r, and can it be reduced using alternative constructions?
• RQ3 Can a non-explicit construction be used to prove the existence of MR codes with field size O(n^{Δ−1}) for fixed r and Δ?
• RQ4 How does modifying the parity-check matrix structure, particularly the choice of field elements, affect the field size and MR property of the resulting code?
• RQ5 Can a puncturing pattern be designed such that the resulting code remains MDS while preserving local repairability and reducing field size?

Key findings

• A construction for high-rate PMR codes is provided, achieving optimal all-symbol locality and MDS puncturing with significantly reduced field size compared to full MR codes.
• For k=5, n=15, the proposed PMR construction requires q > 499, whereas prior constructions require q > 1001 (from [10]) or q ≥ 2^14 (from [16]).
• A modified construction of the parity-check matrix from [15] yields an MR code with field size q−1 ≥ ψm, independent of δ, improving field size efficiency.
• The non-explicit construction proves existence of MR codes with field size O(n^{Δ−1}) for fixed r and Δ, improving upon previous bounds.
• The method ensures that rank conditions on the parity-check matrix are satisfied via polynomial constraints, guaranteeing maximal recoverability.
• The framework allows extension to local codes correcting δ erasures, maintaining field size O(n^{Δ−1}) when blocks are δ×(r+1) in size.