科研之友
微信
新浪微博
Facebook
分享链接
摘要
We show how to find s-PD-sets of the minimal size for the MacDonald q-ary codes where and . The construction of [6] can be used and gives s-PD-sets for s up to the bound , of effective use for u small; for an alternative construction is given that applies up to a bound that depends on the maximum size of a set of vectors in with each pair of vectors distance at least 3 apart.
- 出版日期2016-11
