Upper bounds on matching families in BBZ{pq}^{n}

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

Matching families are one of the major ingredients in the construction of locally decodable codes (LDCs) and the best known constructions of LDCs with a constant number of queries are based on matching families. The determination of the largest size of any matching family in Zmn, where Zm is the rin...