2013 , Volume 18, ¹ 3, p.22-33
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.
Keywords: information theory, coding
Medvedeva Yulia Sergeevna
Office: ICT SB RAS
Address: 630090, Russia, Novosibirsk, 6 Acad. Lavrentjev avenu
Medvedeva Y.S. Fast enumeration of Grassmannian elements // Computational technologies. 2013. V. 18. ¹ 3. P. 22-33