Bounds and Optimal Constructions of Generalized Merge-Convertible Codes for Code Conversion into LRCs
Haoming Shi, Weijun Fang, Yuan Gao
TL;DR
This work addresses dynamic data-storage workloads by studying generalized merge-convertible codes that adapt code parameters on the fly. It introduces a tight lower bound on read/write access cost when the final code is an $$(r,\delta)$$-LRC and delivers multiple explicit, access-optimal constructions: (i) automorphism-based merges between MDS codes (and per-symbol read-optimality), (ii) extensions to conversions between $(r,\delta)$-LRCs, and (iii) a parity-check/GVR-based method to convert MDS codes to optimal $$(r,\delta)$$-LRCs. All constructions operate over finite fields whose sizes grow linearly with the code length, enabling practical deployment. Collectively, the results unify prior bounds, extend them to broader code families, and provide the first explicit optimal MDS-to-LRC conversion with per-symbol read-optimality, significantly advancing dynamic, storage-efficient coding schemes for distributed systems.
Abstract
Error-correcting codes are essential for ensuring fault tolerance in modern distributed data storage systems. However, in practice, factors such as the failure rates of storage devices can vary significantly over time, resulting in changes to the optimal code parameters. To reduce storage cost while maintaining efficiency, Maturana and Rashmi introduced a theoretical framework known as code conversion, which enables dynamic adjustment of code parameters according to device performance. In this paper, we focus exclusively on the bounds and constructions of generalized merge-convertible codes. First, we establish a new lower bound on the access cost when the final code is an $(r,δ)$-LRC. This bound unifies and generalizes all previously known bounds for merge conversion, where the initial and final codes are either LRCs or MDS codes. We then construct a family of access-optimal MDS convertible codes by leveraging subgroups of the automorphism group of a rational function field. It is worth noting that our construction is also per-symbol read access-optimal. Next, we further extend our MDS-based construction to design access-optimal convertible codes for the conversion between $(r,δ)$-LRCs with parameters that have not been previously reported. Finally, using the parity-check matrix approach, we present a construction of access-optimal convertible codes that enable merge conversion from MDS codes to an $(r,δ)$-LRC. To the best of our knowledge, this is the first explicit optimal construction of code conversion between MDS codes and LRCs. All of our constructions are performed over finite fields whose sizes grow linearly with the code length.