Yao Qi, Raja Das, et al.
ISSTA 2009
We prove that the (10,40,4) code found by Best is unique. We then employ this fact to show that A(10,3) =A(11,4) < 78 and A(11,3) =A(12,4) < 156. Optimal codes, bounds on the size of a code, constant- weight codes. © 1994 IEEE
Yao Qi, Raja Das, et al.
ISSTA 2009
Eric Price, David P. Woodruff
FOCS 2011
Limin Hu
IEEE/ACM Transactions on Networking
S.F. Fan, W.B. Yun, et al.
Proceedings of SPIE 1989