Some constructions of storage codes from grassmann graphs

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...

Full description

Saved in:
Bibliographic Details
Main Author: Frédérique, Oggier
Other Authors: School of Physical and Mathematical Sciences
Format: Conference or Workshop Item
Language:English
Published: 2014
Subjects:
Online Access:https://hdl.handle.net/10356/101284
http://hdl.handle.net/10220/19354
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English