Bounds on codes derived by counting components in Varshamov graphs | IEEE Conference Publication | IEEE Xplore