2012/07/04 by Anyu Wang, Zhifang Zhang, Wang, Anyu +1
Computer Science · Mathematics · #Advanced Data Storage Technologies #Cooperative Communication and Network Coding #Distributed systems and fault tolerance #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1207.0879
7 pages
arxiv created 2012/07/04 · openalex publication_date 2012/07/04 · arxiv updated 2012/07/05 · openalex created_date 2019/06/27 · openalex updated_date 2026/07/28
We give an explicit construction of exact cooperative regenerating codes at the MBCR (minimum bandwidth cooperative regeneration) point. Before the paper, the only known explicit MBCR code is given with parameters n=d+r and d=k, while our construction applies to all possible values of n,k,d,r. The code has a brief expression in the polynomial form and the data reconstruction is accomplished by bivariate polynomial interpolation. It is a scalar code and operates over a finite field of size q≥ n. Besides, we establish several subspace properties for linear exact MBCR codes. Based on these properties we prove that linear exact MBCR codes cannot achieve repair-by-transfer.