Linear locally recoverable codes with locality r=1

• المؤلف الرئيسي: Teo, Samuel Tien Ho
• مؤلفون آخرون: Chee Yeow Meng
• التنسيق: Theses and Dissertations
• اللغة: English
• منشور في: 2017
• الموضوعات: DRNTU::Engineering::Computer science and engineering::Data::Coding and information theory
• الوصول للمادة أونلاين: http://hdl.handle.net/10356/69622
• المؤسسة: Nanyang Technological University

A code is called a locally recoverable code (LRC) with locality r if any symbol of a codeword can be recovered by accessing r other symbols that forms the recovering set. A LRC has availability t if each symbol has at least t disjoint recovering sets. In this thesis, we summarise the known propertie...