Frank R. Libsch, S.C. Lien
IBM J. Res. Dev
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
Frank R. Libsch, S.C. Lien
IBM J. Res. Dev
Israel Cidon, Leonidas Georgiadis, et al.
IEEE/ACM Transactions on Networking
Hang-Yip Liu, Steffen Schulze, et al.
Proceedings of SPIE - The International Society for Optical Engineering
Robert C. Durbeck
IEEE TACON