2015/04/20 by Son Hoang Dau, Dau, Son Hoang, Han Mao Kiah +5
Computer Science · Mathematics · #Advanced Data Storage Technologies #Caching and Content Delivery #Combinatorics (math.CO) #Cooperative Communication and Network Coding #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #cs.IT #math.CO #math.IT
paper · pdf · doi:10.48550/arxiv.1504.04926
7 pages
arxiv created 2015/04/20 · openalex publication_date 2015/04/20 · arxiv updated 2015/04/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We consider the locality of encoding and decoding operations in distributed storage systems (DSS), and propose a new class of codes, called locally encodable and decodable codes (LEDC), that provides a higher degree of operational locality compared to currently known codes. For a given locality structure, we derive an upper bound on the global distance and demonstrate the existence of an optimal LEDC for sufficiently large field size. In addition, we also construct two families of optimal LEDC for fields with size linear in code length.