Skip to Main Content
IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards,
eBooks, and eLearning courses.
Learn more about:
IEEE Xplore subscriptions
The authors prove combinatorial lower bounds for Kq (n,R), the minimal cardinality of any q-ary code of length n and covering radius R. Tables of lower bounds for Kq(n,R) are presented for q=3, 4, 5
A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.© Copyright 2016 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.