ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

On Linear Subspace Codes Closed under Intersection

Basu, Pranab and Kashyap, Navin (2015) On Linear Subspace Codes Closed under Intersection. In: 21st National Conference on Communications (NCC), FEB 27-MAR 01, 2015, Indian Inst Technol, Bombay, INDIA.

[img] PDF
21st_Nat_Con_Com_2015.pdf - Published Version
Restricted to Registered users only

Download (247Kb) | Request a copy
Official URL: http://dx.doi.org/10.1109/NCC.2015.7084870

Abstract

Subspace codes are subsets of the projective space P-q(n), which is the set of all subspaces of the vector space F-q(n). Koetter and Kschischang argued that subspace codes are useful for error and erasure correction in random network coding. Linearity in subspace codes was defined by Braun, Etzion and Vardy, and they conjectured that the largest cardinality of a linear subspace code in P-q(n) is 2(n). In this paper, we show that the conjecture holds for linear subspace codes that are closed under intersection, i.e., codes having the property that the intersection of any pair of codewords is also a codeword. The proof is via a characterization of such codes in terms of partitions of linearly independent subsets of F-q(n.). (. .)

Item Type: Conference Proceedings
Related URLs:
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: 24 Aug 2016 09:35
Last Modified: 24 Aug 2016 09:35
URI: http://eprints.iisc.ernet.in/id/eprint/54560

Actions (login required)

View Item View Item