Enumerative Coding for Line Polar Grassmannians.
Ilaria Cardinali, Luca Giuzzi · Institutional Research Information System (Università degli Studi di Brescia) · 2014
Codes arising from Grassmannians have been widely investigated, both as generalization of Reed--Muller codes and for applications to network coding. Recently we introduced some new codes, arising from Polar Grassmannians, namely the set of all subspaces of a vector space GF(q)^(2n+1) which are totally singular with respect to a given non-degenerate quadratic form. The aim of the present paper is to present an efficient enumerative coding and decoding strategy for line polar Grassmann codes.