Raymond F. Boyce, Donald D. Chamberlin, et al.
CACM
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
Raymond F. Boyce, Donald D. Chamberlin, et al.
CACM
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007
Sai Zeng, Angran Xiao, et al.
CAD Computer Aided Design
Ohad Shamir, Sivan Sabato, et al.
Theoretical Computer Science