Some constructions of storage codes from grassmann graphs

• المؤلف الرئيسي: Frédérique, Oggier
• مؤلفون آخرون: School of Physical and Mathematical Sciences
• التنسيق: Conference or Workshop Item
• اللغة: English
• منشور في: 2014
• الموضوعات: DRNTU::Science::Mathematics
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/101284; http://hdl.handle.net/10220/19354
• المؤسسة: Nanyang Technological University

Codes for distributed storage systems may be seen as families of m-dimensional subspaces of the vector space Fnq, where Fq is the finite field with q elements, q a prime power. These subspaces need to intersect, to allow (collaborative) repair. We consider the Grassmann graph Gq(n, m) which has for ve...