Locally Repairable Convolutional Codes With Sliding Window Repair

DOI10.1109/TIT.2020.2977638zbMATH Open1446.94191arXiv1901.02073OpenAlexW2909578158MaRDI QIDQ5124476FDOQ5124476

Authors: Umberto Martínez-Peñas, Diego Napp 

Publication date: 29 September 2020

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: Locally repairable convolutional codes (LRCCs) for distributed storage systems (DSSs) are introduced in this work. They enable local repair, for a single node erasure (or more generally, $partial-1$ erasures per local group), and sliding-window global repair, which can correct erasure patterns with up to ${md}_j^c-1$ erasures in every window of $j+1$ consecutive blocks of $n$ nodes, where ${md}_j^c$ is the $j$th column distance of the code. The parameter $j$ can be adjusted, for a fixed LRCC, according to different catastrophic erasure patterns, requiring only to contact $n(j+1)-{md}_j^c+1$ nodes, plus less than $mun$ other nodes, in the storage system, where $mu$ is the memory of the code. A Singleton-type bound is provided for ${md}_j^c$. If it attains such a bound, an LRCC can correct the same number of catastrophic erasures in a window of length $n(j+1)$ as an optimal locally repairable block code of the same rate and locality, and with block length $n(j+1)$. In addition, the LRCC is able to perform the flexible and somehow local sliding-window repair by adjusting $j$. Furthermore, by adjusting and/or sliding the window, the LRCC can potentially correct more erasures in the original window of $n(j+1)$ nodes than an optimal locally repairable block code of the same rate and locality, and length $n(j+1)$. Finally, the concept of partial maximum distance profile (partial MDP) codes is introduced. Partial MDP codes can correct all information-theoretically correctable erasure patterns for a given locality, local distance and information rate. An explicit construction of partial MDP codes whose column distances attain the provided Singleton-type bound, up to certain parameter $j=L$, is obtained based on known maximum sum-rank distance convolutional codes.

Full work available at URL: https://arxiv.org/abs/1901.02073

zbMATH Keywords

distributed storage systems (DSSs)locally repairable convolutional codes (LRCCs)

Mathematics Subject Classification ID

Convolutional codes (94B10)

Cited In (3)

• Sliding-window dynamic frameproof codes
• Codes in the sum-rank metric: fundamentals and applications
• Efficient Error-Correcting Codes for Sliding Windows

This page was built for publication: Locally Repairable Convolutional Codes With Sliding Window Repair

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5124476)