摘要
研究了二元叠加码δ(n,d,k)的平均汉明距离(Hamming distance)和它的均方差问题.利用δ(n,d,k)的定义和新构造的一个组合函数,获得了求二元叠加码δ(n,d,k)的平均汉明距离和它的均方差公式,并获得了它的平均汉明距离的界.
The main purpose of this article is to study the average Hamming distance and mean square deviation of binary superimposed code δ(n, d, k). By definition of δ(n, d, k) and a new constructed combinatorial function, computational formulas of the average Hamming distance and mean square deviation of binary superimposed code δ(n,d, k) are obtained and the bounds of the average Hamming distance is given.
引文
[1]Macula A J.A simple construction of d-disjunct matrices with certain constant weights[J].Discrete Mathematics,1996,162:311-312.
[2]Macula A J.Nonadaptive Group Testing with Error Resistant d-disjunct Matrices[J].Discrete Applied Mathematics,1998,80:217-282.
[3]Cheraghchi M.Improved Constructions for Non-adaptive Threshold Group Testing[J].Algorithmica,2013,67:384-417.
[4]Damaschke P,Muhammad A S,Wiener G.Strict group testing and the set basis problem[J].Journal of Combinatorial Theory Series A,2014,126:70-91.
[5]夏树涛,符方伟.二元码的平均Hamming距离和方差[J]·数学物理学报,1999,19(4):368-372.
[6]Alth(o|¨)fer I,sillke T.An Average Distance Inequality for Large Subsets of the Cube[J].Journal of Combinatorial Theory,Series B,1992,56:296-301.
[7]钱国栋,赵燕冰.二元叠加码的检错性和纠错性[J].河北师范大学学报(自然科学版),2010,2:125-127+209.
[8]曹汝成.组合数学[M].华南理工大学出版社,广州,2000.