Article information

2013 , Volume 18, 3, p.22-33

Medvedeva Y.S.

Fast enumeration of Grassmannian elements

The Grassmannian Gq(n,k) is the set of all k-dimensional subspaces of vector space Fqn . The coding of elements of Grassmannian was considered in many papers and has the application in network coding. We present the advanced algorithm of the enumerative coding of the elements of the Grassmannian, which has less computational complexity than other known algorithms of coding of Grassmannian elements do.

[full text]
Keywords: information theory, coding

Author(s):
Medvedeva Yulia Sergeevna
Position: Student
Office: ICT SB RAS
Address: 630090, Russia, Novosibirsk, 6 Acad. Lavrentjev avenu
E-mail: mjulja@gmail.com


Bibliography link:
Medvedeva Y.S. Fast enumeration of Grassmannian elements // Computational technologies. 2013. V. 18. 3. P. 22-33
Home| Scope| Editorial Board| Content| Search| Subscription| Rules| Contacts
ISSN 1560-7534
© 2020 Institute of Computational Technologies SB RAS