Yao Qi, Raja Das, et al.
ISSTA 2009
Paper
The Uniqueness of the Best Code
Abstract
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
Related
Conference paper
Global routing revisited
Michael D. Moffitt
ICCAD 2009
Joel L. Wolf, Mark S. Squillante, et al.
IEEE Transactions on Knowledge and Data Engineering
Qing Li, Zhigang Deng, et al.
IEEE T-MI