A subspace regenerating code with minimum decoding bandwidth. Issue 2 (24th December 2021)

• Record Type: Journal Article
• Authors: Liu, Yantao; Qin, Na
• Is Part Of: IET communications. Volume 16:Issue 2(2022)
• Page Start: 131
• Page End: 141
• Publication Date: 2021-12-24
• Subjects: Telecommunication systems -- Periodicals; Speech processing systems -- Periodicals; 621.38205
• DOI: 10.1049/cmu2.12319
• Languages: English
• ISSNs: 1751-8628

Abstract

Abstract: Hollmann built a theoretical framework for subspace regenerating storage code. In this framework, a storage node is equipped with a constant dimension subspace chosen from an overall message space F q m ${\bm{F}}_{\bm{q}}^{\bm{m}}$ . The projection of user message on the subspace is stored on the corresponding node. A subspace code needs to fulfil decoding and repairing functionality. The framework stipulates the property for subspace storage code, but a simple implementable construction is still missing. To decrease the complexity of code design as well as encoding and decoding, this article proposed a subspace code implementation over F2 with the parameters of ( m, m, 2, ⌈ m 2 ⌉, r, β ) $({\bm{m}}, {\bm{m}}, 2, \lceil {\frac{{\bm{m}}}{2}} \rceil, {\bm{\ r}}, {\bm{\beta }})$ . It is proved theoretically the code is characterized by minimum decoding bandwidth, minimum storage, and exact repair. Still, the code is explicit, feasible and lightweight. A series of examples are given to elucidate the encoding, decoding and repairing procedures, which show in cases of m ≤ 5, the code could achieve high repair efficiency by combining with network coding.