Enumerative Encoding in the Grassmannian Space

Simple item page
dc.creatorSilberstein, Natalia
dc.creatorEtzion, Tuvi
dc.date2009-03-09
dc.date.accessioned2026-07-07T12:50:28Z
dc.date.available2026-07-07T12:50:28Z
dc.descriptionCodes in the Grassmannian space have found recently application in network coding. Representation of $k$-dimensional subspaces of $\F_q^n$ has generally an essential role in solving coding problems in the Grassmannian, and in particular in encoding subspaces of the Grassmannian. Different representations of subspaces in the Grassmannian are presented. We use two of these representations for enumerative encoding of the Grassmannian. One enumerative encoding is based on Ferrers diagrams representation of subspaces; and another is based on identifying vector and reduced row echelon form representation of subspaces. A third method which combine the previous two is more efficient than the other two enumerative encodings.
dc.description2009 Informaton Theory Workshop, Taormina
dc.identifierhttps://arxiv.org/abs/0903.1556
dc.identifierhttp://arxiv.org/abs/0903.1556
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/222698
dc.subjectInformation Theory
dc.titleEnumerative Encoding in the Grassmannian Space
dc.typetext

Files

Collections

arXiv