2015/02/03 by Wentu Song, Song, Wentu, Son Hoang Dau +3
Computer Science · Mathematics · #Advanced Data Storage Technologies #Caching and Content Delivery #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1502.00842
9 pages
openalex publication_date 2015/02/03 · arxiv created 2015/07/29 · arxiv updated 2015/07/30 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
We introduce a new family of erasure codes, called group decodable code (GDC), for distributed storage system. Given a set of design parameters α; β; k; t, where k is the number of information symbols, each codeword of an (α; β; k; t)-group decodable code is a t-tuple of strings, called buckets, such that each bucket is a string of βsymbols that is a codeword of a [β; α] MDS code (which is encoded from αinformation symbols). Such codes have the following two properties: (P1) Locally Repairable: Each code symbol has locality (α; β-α+ 1). (P2) Group decodable: From each bucket we can decode αinformation symbols. We establish an upper bound of the minimum distance of (α; β; k; t)-group decodable code for any given set of α; β; k; t; We also prove that the bound is achievable when the coding field F has size |F| > n-1 \choose k-1.