Let Fq={0, 1,..., q− 1} be an alphabet of size q, so that Fn q is the q-ary hypercube of
dimension n. Let x=(x1,..., xn) and y=(y1,..., yn) be two elements in Fn q. The Lee distance …

Let kq (n) denote the minimal cardinality of a q-ary code C of length n and covering radius
one. The numbers of elements of C that lie in a fixed k-dimensional subspace of {0,…, q− 1} …

Abstract Let $ K_q (n, R) $ denote the minimal cardinality of a $ q $-ary code of length $ n $
and covering radius $ R $. Recently the authors gave a new proof of a classical lower bound …

A binary code with covering radius R is a subset C of the hypercube Qn={0, 1} n such that
every x∈ Qn is within Hamming distance R of some codeword c∈ C, where R is as small as …

PubTeX output 2008.02.12:1112 Page 1 IEEE TRANSACTIONS ON INFORMATION THEORY,
VOL. 54, NO. 3, MARCH 2008 1291 for coding. For example, for any integer i 0 and for any real …

Let $ n_q (M, d) $ be the minimum length of a $ q $-ary code of size $ M $ and minimum
distance $ d $. Bounding $ n_q (M, d) $ is a fundamental problem that lies at the heart of …

Let kq (n) denote the minimal cardinality of a q-ary code C of length n and covering radius
one. The numbers of elements of C that lie in a fixed k-dimensional subspace of {0,…, q− 1} …

In this paper, we give lower and upper bounds on the covering radius of codes over the ring
Z4 with respect to chinese euclidean distance. We also determine the covering radius of …

Let K q (n, R) denote the minimum number of codewords in any q-ary code of length n and
covering radius R. We collect lower and upper bounds for K q (n, R) where 6≤ q≤ 21 and …

Determining the maximum number of unit vectors in R r R^r with no pairwise inner product
exceeding α α is a fundamental problem in geometry and coding theory. In 1955, Rankin …