Applications of quasi-uniform codes to storage
We consider the design of quasi-uniform codes from dihedral 2-groups. Quasi-uniform codes have the distinctive feature of allowing codeword coefficients to live in different alphabets. We obtain a bound on the minimum distance of quasiuniform codes coming from p-groups as a function of the number of...
Saved in:
| Main Authors: | , |
|---|---|
| 其他作者: | |
| 格式: | Conference or Workshop Item |
| 語言: | English |
| 出版: |
2015
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/103619 http://hdl.handle.net/10220/24617 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Nanyang Technological University |
| 語言: | English |
| 總結: | We consider the design of quasi-uniform codes from dihedral 2-groups. Quasi-uniform codes have the distinctive feature of allowing codeword coefficients to live in different alphabets. We obtain a bound on the minimum distance of quasiuniform codes coming from p-groups as a function of the number of p-ary codeword components. We study possible applications of such codes to storage, where the minimum distance is important to allow object retrieval, yet binary coefficients are preferred for fast computations, for example during repairs. |
|---|