Error-Correcting Codes in Projective Space

The projective space of order n over the finite field \BBFq, denoted here as Pq(n), is the set of all subspaces of the vector space \BBFqn . The projective space can be endowed with the distance function d(U, V) = dimU + dimV -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 2t + 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.

[1]  Shu-Tao Xia,et al.  Johnson type bounds on constant dimension codes , 2007, Des. Codes Cryptogr..

[2]  Rudolf Ahlswede,et al.  On Perfect Codes and Related Concepts , 2001, Des. Codes Cryptogr..

[3]  Alexander Vardy,et al.  Error-correcting codes in projective space , 2008, 2008 IEEE International Symposium on Information Theory.

[4]  Farshad Lahouti,et al.  Block network error control codes and syndrome-based maximum likelihood decoding , 2008, 2008 IEEE International Symposium on Information Theory.

[5]  Maximilien Gadouleau,et al.  Constant-rank codes , 2008, 2008 IEEE International Symposium on Information Theory.

[6]  Frank R. Kschischang,et al.  A Rank-Metric Approach to Error Control in Random Network Coding , 2007, IEEE Transactions on Information Theory.

[7]  Martin Bossert,et al.  Codes for network coding , 2008, 2008 IEEE International Symposium on Information Theory.

[8]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[9]  Simon Thomas,et al.  Designs over finite fields , 1987 .

[10]  Sascha Kurz,et al.  Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance , 2008, MMICS.

[11]  Alexander Vardy,et al.  Maximum-Likelihood Soft Decision Decoding of Bch Codes , 1993, Proceedings. IEEE International Symposium on Information Theory.

[12]  Ludo M. G. M. Tolhuizen,et al.  The generalized Gilbert-Varshamov bound is implied by Turan's theorem [code construction] , 1997, IEEE Trans. Inf. Theory.

[13]  Suhas N. Diggavi,et al.  Noncoherent multisource network coding , 2008, 2008 IEEE International Symposium on Information Theory.

[14]  Tor Bu Partitions of a vector space , 1980, Discret. Math..

[15]  Alexander Vardy,et al.  Linearity and Complements in Projective Space , 2011, ArXiv.

[16]  Simon Thomas,et al.  Designs and partial geometries over finite fields , 1996 .

[17]  Christine Bachoc,et al.  Semidefinite programming, harmonic analysis and coding theory , 2009, ArXiv.

[18]  P. Delsarte AN ALGEBRAIC APPROACH TO THE ASSOCIATION SCHEMES OF CODING THEORY , 2011 .

[19]  Laura M. Chihara On the zeros of the Askey-Wilson polynomials, with applications to coding theory , 1987 .

[20]  Maximilien Gadouleau,et al.  Constant-Rank Codes and Their Connection to Constant-Dimension Codes , 2008, IEEE Transactions on Information Theory.

[21]  Frank R. Kschischang,et al.  Security for wiretap networks via rank-metric codes , 2007, 2008 IEEE International Symposium on Information Theory.

[22]  Christine Bachoc,et al.  Applications of semidefinite programming to coding theory , 2010, 2010 IEEE Information Theory Workshop.

[23]  Maximilien Gadouleau,et al.  Packing and Covering Properties of Subspace Codes for Error Control in Random Linear Network Coding , 2008, IEEE Transactions on Information Theory.

[24]  Peter Frankl,et al.  The Erdös-Ko-Rado theorem for vector spaces , 1986, J. Comb. Theory, Ser. A.

[25]  Joachim Rosenthal,et al.  Spread codes and spread decoding in network coding , 2008, 2008 IEEE International Symposium on Information Theory.

[26]  Alexander Vardy,et al.  On q-analogs of Steiner systems and covering designs , 2009, Adv. Math. Commun..

[27]  Tuvi Etzion Perfect Byte-Correcting Codes , 1998, IEEE Trans. Inf. Theory.

[28]  Moshe Schwartz,et al.  Codes and Anticodes in the Grassman Graph , 2002, J. Comb. Theory, Ser. A.

[29]  Andrea Montanari,et al.  Iterative Coding for Network Coding , 2013, IEEE Transactions on Information Theory.

[30]  Reihaneh Safavi-Naini,et al.  Linear authentication codes: bounds and constructions , 2001, IEEE Trans. Inf. Theory.

[31]  Papa A. Sissokho,et al.  Partitions of finite vector spaces into subspaces , 2008 .

[32]  Frank R. Kschischang,et al.  Coding for Errors and Erasures in Random Network Coding , 2008, IEEE Trans. Inf. Theory.

[33]  William J. Martin,et al.  Anticodes for the Grassman and bilinear forms graphs , 1995, Des. Codes Cryptogr..