An Improved Upper Bound of the Rate of Euclidean Superimposed Codes
暂无分享,去创建一个
[1] G. Pisier. The volume of convex bodies and Banach space geometry , 1989 .
[2] P. Erdös,et al. Families of finite sets in which no set is covered by the union ofr others , 1985 .
[3] Zoltán Füredi. On r-Cover-free Families , 1996, J. Comb. Theory, Ser. A.
[4] László Györfi,et al. Superimposed codes in Rn , 1988, IEEE Trans. Inf. Theory.
[5] Zoltán Füredi,et al. Families of Finite Sets in Which No Set Is Covered by the Union of Two Others , 1982, J. Comb. Theory, Ser. A.
[6] P.-O. Anderson. A construction of superimposed codes for the Euclidean channel , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.
[7] Richard C. Singleton,et al. Nonrandom binary superimposed codes , 1964, IEEE Trans. Inf. Theory.
[8] Zoltdn Fiiredi. Superimposed Codes are Almost Big Distance Ones , 1997 .
[9] V. Milman,et al. Almost Euclidean quotient spaces of subspaces of a finite-dimensional normed space , 1985 .
[10] Miklós Ruszinkó,et al. On the Upper Bound of the Size of the R-Cover-Free Families , 1993, Proceedings. IEEE International Symposium on Information Theory.
[11] B. Bollobás. THE VOLUME OF CONVEX BODIES AND BANACH SPACE GEOMETRY (Cambridge Tracts in Mathematics 94) , 1991 .
[12] Selmer M. Johnson. A new upper bound for error-correcting codes , 1962, IRE Trans. Inf. Theory.
[13] Selmer M. Johnson. On upper bounds for unrestricted binary-error-correcting codes , 1971, IEEE Trans. Inf. Theory.
[14] Selmer M. Johnson. Improved asymptotic bounds for error-correcting codes , 1963, IEEE Trans. Inf. Theory.
[15] F. Hwang. A Method for Detecting all Defective Members in a Population by Group Testing , 1972 .