A Bound-achieving Modified Etzion-Vardy (5,3) Projective Space Code

Ghatak, Anirban (2016) A Bound-achieving Modified Etzion-Vardy (5,3) Projective Space Code. In: 22nd National Conference on Communications (NCC), MAR 04-06, 2016, Guwahati, INDIA.

PDF Twe_Sec_Nat_Con_c-Com_2016.pdf - Published Version Restricted to Registered users only Download (221kB) | Request a copy

Abstract

Since the Kotter-Kschischang formulation for error and erasure correction for random networks over subspaces, there exists a considerable body of work related to the construction of subspace codes. Etzion and Vardy gave the first bounds on the size of non-constant dimension subspace codes, also termed projective space codes, and gave an example of a (5, 3) projective space code which was claimed to achieve the upper bound. We show that the Etzion-Vardy code is not constructible by the existing multi-level non-constant dimension code constructions based on Ferrers-diagram rank-metric (FDRM) codes. Moreover, we construct a modified code based on the Etzion-Vardy code which achieves the bound, by introducing minimal changes in the structure of the existing code. We also conjecture that no other bound-achieving code can be constructed for these parameters under the restriction of these minimal changes.

Item Type:	Conference Proceedings
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:	04 Jan 2017 04:57
Last Modified:	04 Jan 2017 04:57
URI:	http://eprints.iisc.ac.in/id/eprint/55719

Actions (login required)

View Item