Error-Correcting Codes in Projective Space

The projective space of order
n
over the finite field \BBF
q
, denoted here as
Pq
(
n
), is the set of all subspaces of the vector space \BBF
qn
. The projective space can be endowed with the distance function
d
(
U
,
V
) = dim
U
+ dim
V
-2 dim(
U
∩
V
) which turns
Pq
(
n
) into a metric space. With this, an (
n
,
M
,
d
) code \BBC in projective space is a subset of
Pq
(
n
) of size
M
such that the distance between any two codewords (subspaces) is at least
d
. Koetter and Kschischang recently showed that codes in projective space are precisely what is needed for error-correction in networks: an (
n
,
M
,
d
) code can correct
t
packet errors and ρ packet erasures introduced (adversarially) anywhere in the network as long as 2
t
+ 2ρ <;
d
. This motivates our interest in such codes. In this paper, we investigate certain basic aspects of “coding theory in projective space.” First, we present several new bounds on the size of codes in
Pq
(
n
), which may be thought of as counterparts of the classical bounds in coding theory due to Johnson, Delsarte, and Gilbert-Varshamov. Some of these are stronger than all the previously known bounds, at least for certain code parameters. We also present several specific constructions of codes and code families in
Pq
(
n
). Finally, we prove that nontrivial perfect codes in
Pq
(
n
) do not exist.