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...
Saved in:
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Conference or Workshop Item |
| 語言: | English |
| 出版: |
2014
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/101284 http://hdl.handle.net/10220/19354 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Nanyang Technological University |
| 語言: | English |