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...
Main Authors: | Fu, Fang-Wei, Ling, San, Xing, Chaoping |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Journal Article |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/96425 http://hdl.handle.net/10220/9840 |
Similar Items
-
An explicit class of codes with good parameters and their duals
by: Özbudak, Ferruh, et al.
Published: (2013) -
On the representability of the biuniform matroid
by: Ball, Simeon, et al.
Published: (2014) -
Optimal rate list decoding of folded algebraic-geometric codes over constant-sized alphabets
by: Guruswami, Venkatesan, et al.
Published: (2015) -
On the bounded distance decoding problem for lattices constructed and their cryptographic applications
by: Li, Zhe, et al.
Published: (2020) -
On the Fourier spectra of new APN functions
by: Tan, Yin, et al.
Published: (2014)