Enumerative encoding in the Grassmannian space

Natalia Silberstein, Tuvi Etzion

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Codes in the Grassmannian space have found recently application in network coding. Representation of k- dimensional subspaces of Fqn 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.

Original languageEnglish
Title of host publication2009 IEEE Information Theory Workshop, ITW 2009
Pages544-548
Number of pages5
DOIs
StatePublished - 7 Dec 2009
Externally publishedYes
Event2009 IEEE Information Theory Workshop, ITW 2009 - Taormina, Sicily, Italy
Duration: 11 Oct 200916 Oct 2009

Publication series

Name2009 IEEE Information Theory Workshop, ITW 2009

Conference

Conference2009 IEEE Information Theory Workshop, ITW 2009
Country/TerritoryItaly
CityTaormina, Sicily
Period11/10/0916/10/09

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Information Systems
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Enumerative encoding in the Grassmannian space'. Together they form a unique fingerprint.

Cite this