Query-efficient locally decodable codes of subexponential length

• المؤلفون الرئيسيون: Chee, Yeow Meng, Feng, Tao, Ling, San, Wang, Huaxiong, Zhang, Liang Feng
• مؤلفون آخرون: School of Physical and Mathematical Sciences
• التنسيق: مقال
• اللغة: English
• منشور في: 2012
• الموضوعات: DRNTU::Science::Mathematics
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/94604; http://hdl.handle.net/10220/7636
• المؤسسة: Nanyang Technological University

A k-query locally decodable code (LDC) C : Σn → ΓN encodes each message x into a codeword C(x) such that each symbol of x can be probabilistically recovered by querying only k coordinates of C(x), even after a constant fraction of the coordinates has been corrupted. Yekhanin (2008) constructed a 3-q...