On the variance of average distance of subsets in the Hamming space
Let V be a finite set with q distinct elements. For a subset C of V n, denote var(C) the variance of the average Hamming distance of C. Let T (n,M; q) and R(n,M; q) denote the minimum and maximum variance of the average Hamming distance of subsets of V n with cardinality M, respectively. In this pa...
Saved in:
| Main Authors: | , , |
|---|---|
| 其他作者: | |
| 格式: | Article |
| 語言: | English |
| 出版: |
2013
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/96425 http://hdl.handle.net/10220/9840 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Nanyang Technological University |
| 語言: | English |
| 總結: | Let V be a finite set with q distinct elements. For a subset C of V n, denote var(C) the variance of the average Hamming
distance of C. Let T (n,M; q) and R(n,M; q) denote the minimum and maximum variance of the average Hamming distance of subsets of V n with cardinality M, respectively. In this paper, we study T (n,M; q) and R(n,M; q) for general q. Using methods from coding theory, we derive upper and lower bounds on var(C), which generalize and unify the bounds for the case q = 2. These bounds enable us to determine the exact value for T (n,M; q) and R(n,M; q) in several cases. |
|---|