Projective Space Codes for the Injection Metric

Simple item page
dc.creatorKhaleghi, Azadeh
dc.creatorKschischang, Frank R.
dc.date2009-04-05
dc.date2009-04-08
dc.date.accessioned2026-07-07T13:01:10Z
dc.date.available2026-07-07T13:01:10Z
dc.descriptionIn the context of error control in random linear network coding, it is useful to construct codes that comprise well-separated collections of subspaces of a vector space over a finite field. In this paper, the metric used is the so-called "injection distance", introduced by Silva and Kschischang. A Gilbert-Varshamov bound for such codes is derived. Using the code-construction framework of Etzion and Silberstein, new non-constant-dimension codes are constructed; these codes contain more codewords than comparable codes designed for the subspace metric.
dc.identifierhttps://arxiv.org/abs/0904.0813
dc.identifierhttp://arxiv.org/abs/0904.0813
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/226071
dc.subjectInformation Theory
dc.titleProjective Space Codes for the Injection Metric
dc.typetext

Files

Collections

arXiv