Pai, Srikanth B and Rajan, Sundar B
(2015)
*On the Bounds of Certain Maximal Linear Codes in a Projective Space.*
In: IEEE International Symposium on Information Theory (ISIT, JUN 14-19, 2015, Hong Kong, PEOPLES R CHINA, pp. 591-595.

PDF
IEEE_Int_Sym_Inf_The_591_2015.pdf - Published Version Restricted to Registered users only Download (110kB) | Request a copy |

## Abstract

The set of all subspaces of F-q(n) is denoted by P-q(n). The subspace distance d(S)(X, Y) = dim (X) + dim (Y) - 2 dim (X boolean AND Y) defined on P-q(n) turns it into a natural coding space for error correction in random network coding. A subset of P-q(n) is called a code and the subspaces that belong to the code are called codewords. Motivated by classical coding theory, a linear coding structure can be imposed on a subset of P-q(n). Braun, Etzion and Vardy conjectured that the largest cardinality of a linear code, that contains F-q(n), is 2(n). In this paper, we prove this conjecture and characterize the maximal linear codes that contain F-q(n).

Item Type: | Conference Paper |
---|---|

Series.: | IEEE International Symposium on Information Theory |

Additional Information: | Copy right for this article belongs to the IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA |

Department/Centre: | Division of Electrical Sciences > Electrical Communication Engineering |

Date Deposited: | 07 Dec 2016 05:28 |

Last Modified: | 07 Dec 2016 05:28 |

URI: | http://eprints.iisc.ac.in/id/eprint/55506 |

### Actions (login required)

View Item |