{"paper":{"title":"Erasure codes with symbol locality and group decodability for distributed storage","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chau Yuen, Son Hoang Dau, Wentu Song","submitted_at":"2015-02-03T12:38:32Z","abstract_excerpt":"We introduce a new family of erasure codes, called group decodable code (GDC), for distributed storage system. Given a set of design parameters {\\alpha; \\beta; k; t}, where k is the number of information symbols, each codeword of an (\\alpha; \\beta; k; t)-group decodable code is a t-tuple of strings, called buckets, such that each bucket is a string of \\beta symbols that is a codeword of a [\\beta; \\alpha] MDS code (which is encoded from \\alpha information symbols). Such codes have the following two properties: (P1) Locally Repairable: Each code symbol has locality (\\alpha; \\beta-\\alpha + 1). (P"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00842","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}